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).
#!/usr/bin/python3


# conver list to dict
def to_dict(alist):            
    adict = {}
    for item in alist:
        if item in adict.keys():
            adict[item] = adict[item] + 1
        else:
            adict[item] = 1
    return adict



# read the input
line1 = input().split(" ")
n = int(line1[0]) 
sequence = input().split(" ")

# covert to dictionary 
sequence_map = to_dict(sequence) 

print(n - max(sequence_map.values()))



