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()))
a.sort()
k = 0
b = 0
c = 0
d = 0
while a[k] == 1 and k < len(a):
    b += 1
    k += 1
while a[k] == 2 and k < len(a):
    c += 1
    k += 1
k = len(a) -1
while a[k] == 3:
    d += 1
    k -= 1
f = b + c
e = b + d
p = c + d
print(min(f,e,p))