There is a given sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each other.
The first line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>). The second line contains a sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 3).
n = int(input())

sequence = input().split()
count = 0

if sequence.count("1") >= sequence.count("2") and sequence.count("1") >= sequence.count("3"):
    count += (sequence.count("2") + sequence.count("3"))
elif sequence.count("2") >= sequence.count("1") and sequence.count("2") >= sequence.count("3"):
    count += (sequence.count("1") + sequence.count("3"))
elif sequence.count("3") >= sequence.count("1") and sequence.count("3") >= sequence.count("2"):
    count += (sequence.count("1") + sequence.count("2"))

print(count)
