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())
l=list(map(int,input().split()))
s,t,r=0,0,0
for i in l:
    if i==1:
        s+=1
    elif i==2:
        t+=1
    else:
        r+=1
s=n-s
t=n-t
r=n-r
y=min(s,t,r)
print(int(y))
	 		  	 	  	 			  		 		  	