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())
z=list(map(int,input().split()))

one=0
two=0
three=0

for i in z :
    if i==1 :
        one+=1
    elif i==2 :
        two+=1
    else :
        three+=1

if one > two and one > three :
    print(n-one)
elif two>one and two >three :
    print(n-two)
elif three>one and three>two :
    print(n-three)
else :
    print(n-max(one,two,three))
      	  				 	 		 	  	   		