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())
list1=list(map(int ,input().split()))
g=list1.count(1)
h=list1.count(2)
k=list1.count(3)
tp=max(g,h,k)
if(g==tp):
    count=0
    for i in range(n):
        if(list1[i]==1):
            count+=1
elif(h==tp):
    count=0    
    for i in range(n):
        if(list1[i]==2):
            count+=1
else:
    count=0
    for i in range(n):
        if(list1[i]==3):
            count+=1         
            
print(n-count)    