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=list(map(int,input().split()))
b=0
c1=0
c2=0
c3=0
for i in range(n):
    if(a[i]==1):
        c1+=1
    elif(a[i]==2):
        c2+=1
    else:
        c3+=1
b=c1+c2
if(b>c2+c3):
    b=c2+c3
if(b>c3+c1):
    b=c3+c1
print(b)

