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).
total_number=int(input())
print(total_number "\n")
my_list=input()
user_list=my_list.split()
print(user_list)
a, b, c = 0, 0, 0
for num in user_list:
    if num==1:
        a+=1
    elif num==2:
        b+=1
    elif num==3:
        c+=1
d=max(a,b,c)
print (total_number-d)
    