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())
a = list(map(int, input().split()))
one = 0
two = 0
tre = 0
for i in a:
    if i == 1:
        one += 1
    elif i == 2:
        two += 1
    else:
        tre += 1
if max(one, two, tre) == one:
    print(two + tre)
elif max(one, two, tre) == two:
    print(one + tre)
else:
    print(one + two)
