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()))[:n]
x=0
y=0
z=0
for i in range(n):
    if a[i]==1:
        x+=1 
    elif a[i]==2:
        y+=1 
    else:
        z+=1
if x==y and x==z:
    print(n-x)
else:
    if x>=y and x>=z:
        print(n-x)
    elif y>=x and y>=z:
        print(n-y)
    else:
        print(n-z)