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())
a = [int(i) for i in input().split()]
ans = n
s1 = 0
s2 = 0
s3 = 0
for i in range(n):
    if a[i] == 1:
        s1 += 1
    elif a[i] == 2:
        s2 += 1
    else:
        s3 += 1
S = max(s1,s2, s3)
if S == s1:
    ans -= s1
elif S == s2:
    ans -= s2
else:
    ans -= s3
print(ans)
