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())
seq = list(map(int, input().split()))

tot = [0, 0, 0]
for el in seq:
    if el == 1:
        tot[0] += 1
    elif el == 2:
        tot[1] += 1
    elif el == 3:
        tot[2] += 1

M = max(tot)
index = tot.index(M)
ans = 0
for i in range(3):
    if i != index:
        ans += tot[i]

print(ans)