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).
value=int(input("")) 
x=0 
while(x<value):
    value2=input("")
    numbers=[]
    numbers.append(value2)
    
        
    x+=1
y=numbers.count(1) 
z=numbers.count(2)
r=numbers.count(3)
if(y>z and y>r):
    print(value-y)
elif(z>y and z>r):
    print(value-z)
    
elif(r>z and r>y):
    print(value-r)
    
    

    
    

