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=[]
x=[]
for i in range(n):
    l+=[int(input()]
r=0
for i in range(n):
    k=0
    if l[i] not in x:
        for j in range(n):
            if l[i]==l[j]
               k+=1
        if k>=n//2:
           r=k
           break
        elif K>r:
           r=k
    x+=[int(l[i])]       
print(n-r)