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