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=input().split()[:]
s=0
q=1
c=[]
for i in range(len(a)):
    a[i]=int(a[i])
maxx=0
mmm=0
l=1
a=sorted(a)
for i in range(n-1):
    if a[i]!=a[i+1]:  
        c.append(a[i])
for i in range(len(c)):
    q=a.count(c[i])
    if q>maxx:
        maxx=q
        mmm=c[i]
if q==1:
    mmm=(sum(a)//len(a))
    
for i in range(len(a)):
    s+=abs(a[i]-mmm)
print(s)

					   			 		  			 	 	 		   		