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).
a=input()
b=list(map(int,input().split()))
d=0
c=min(b)
for j in b:
    if j==c:
        d+=1
        qwer=b.index(j)
        b.pop(qwer)
f=d
e=min(b)
for i in b:
    if i==e:
        d+=1
        asdf=b.index(i)
        b.pop(asdf)
print(f+d)