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).
import sys

n = int(sys.stdin.readline().strip())
a = sys.stdin.readline().strip().split()

def findMin(n,a):
    nums = {'1':0,'2':0,'3':0}
    for num in a:
        nums[num]+=1
    return min(nums['1']+nums['2'],nums['1']+nums['3'],nums['2']+nums['3'])


print(findMin(n,a))    
        
    
