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 = sorted(list(map(int,input().split())))
d = []
s  = a[0]
t = 1
for i in range(1,len(a)):
    if a[i] == s:
        t += 1
    else:
        d += [t]
        s = a[i]
        t = 1
d += [t]
print(abs(max(d)-len(a)))


   		    		 	  			 	 		  	 	 	