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).
length = int(input())
number = str(input())
numbers = number.split(" ")
i = 1
runned = 0
mode = 0
swapcount = 0
def find_mode(data):
    countdict = {}
    for item in data:
        countdict[item] = countdict.get(item, 0) + 1
    mode_value = max(countdict, key=countdict.get)
    return int(mode_value)
mode = find_mode(numbers)
for _ in range(length):
    if int(numbers[_]) != mode:
        swapcount += 1
print(swapcount)