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).
num=int(input())
count1=0
count2=0
count3=0
list=list(map(int,input().split()))
for i in range(num):
    if list[i]==1:
        count1+=1
    if list[i]==2:
        count2+=1
    if list[i]==3:
        count3+=1
max=max(count1,count2,count3)
print(count1+count2+count3-max)