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).
n = int(input())
cont = []
for _ in range(n):
    l = int(input())
    cont.append(l)
    l = 0

a = 0
b = 0
c = 0
ans = 0

for i in range(len(cont)):
    if cont[i] == 1:
        a += 1
    elif cont[i] == 2:
        b += 1
    elif cont[i] == 3:
        c += 1

if a > b and a > c:
    for i in range(len(cont)):
        if cont[i] != 1:
            cont[i] = 1
            ans += 1
elif b > a and b > c:
    for i in range(len(cont)):
        if cont[i] != 2:
            cont[i] = 2
            ans += 1
elif c > a and c > b:
    for i in range(len(cont)):
        if cont[i] != 3:
            cont[i] = 3
            ans += 1

print(ans)