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).
def calculate(list1):
    ones=0,twos=0,threes=0
    for i in list1:
        if i==1:
            ones=ones+1
        elif i==2:
            twos= twos+1
        else:
            threes += 1
    if (ones>twos and ones> threes):
        return 1
    elif (twos>ones and twos>threes):
        return 2
    elif (threes>ones and threes>twos):
        return 3
    elif (ones==threes):
        return 3
    elif (twos==threes):
        return 2
    elif(ones==twos):
        return 1
        
N=int(input())
replacements=0
numbers =list(map(int, input().split()[:N]))
most= calculate(numbers)
for i in range(N):
    if numbers[i]!= most:
        replacements+=1
print(replacements)

       	  						  	 			 	    	