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

data = []
for line in sys.stdin:
    if line[-1] == "\n":
        data.append(line[:-1])
    else:
        data.append(line)


l = data[1].split(" ")

record = [0, 0, 0]
for i in l:
    if i == '1':
        record[0] += 1
    elif i == '2':
        record[1] += 1
    else:
        record[2] += 1

sum = 0
bigger = 0
for n in record:
    if n <= bigger:
        sum += n
    else:
        sum += bigger
        bigger = n

assert(sum + bigger == int(data[0]))
print(sum)