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).
a = int(input())
lis= list(map(int,input().split()))
maxi = []
str1 = ""
for k in lis:
    str1 += str(k)
set1 = set(lis)
lis1 = list(set1)
for i in range(len(lis1)):
    h = str1.count(str(lis1[i]))
    maxi.append(h)
    maxi.sort()
maximum = (maxi[-1])
dif = len(lis)-maximum
ans = []
countans = 0
for g in lis:
    cnt = str1.count(str(g))
    if cnt == maximum:
        ans.append(g)
req = (ans[0])
for final in lis:
    final -= req
    countans += (abs(final))
print(countans)


