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 = [int(i) for i in input().split()]
s = 0
ans = 0
for i in range(n):
    s += a[i]
s1 = s - n
s2 = abs(s - 2 * n)
s3 = 3*n - s
S = min(s1, s2, s3)
if S == s1:
    ans = s1
elif S == s3:
    ans = s3
else:
    for i in range(n):
        ans += abs(2 - a[i])
print(ans)