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())
l=list(map(int,input().split()))
v=list(set(l))
if len(v)==1:
    print('0')
elif len(v)==2:
    c=0
    for i in range(n):
        if l[i]==v[0]:
         c+=1
    if c>n//2:
        print(n-c)
    else:
        print(c)
    
else:
    w=[]
    for i in range(3):
        c=0
        for j in range(n):
            if l[j]==v[i]:
                c+=1
        w.append(c)        
    d=max(w)
    print(n-d)
    
    
