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(int(input()))

a=input()

a=a.split(' ')

for i in range(n):
    a[i]=int(a[i])
    
# count_num=[0 0 0]
# for i in range(n):
#     if a[i]==1:
#         count[0]+=1
#     elif a[i]==2:
#         count[1]+=1
#     elif a[i]==3:
#         count[2]+=1

count_123=[0,0,0]
for i in range(1,4):
    count_123[i-1]=a.count(i)

max_123=max(count_123)
sum_123=sum(count_123)

output_123=sum_123-max_123
print(output_123)
    
    




