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).
g = int(input())
l = list(map(int,input().split()))
cnt = 0
k = l.count(2)
h = l.count(3)
j = l.count(1)
if k>h and k>j:
    for i in l:
        if i!=2:
            cnt+=1
            l.remove(i)
            l.insert(i,2)
        else:
            l.remove(i)
            l.insert(i,2)
elif h>k and h>j:
    for i in l:
        if i!=3:
            cnt+=1
            l.remove(i)
            l.insert(i,3)
        else:
            l.remove(i)
            l.insert(i,3)
            
else:
    for i in l:
        if i!=1:
            cnt+=1
            l.remove(i)
            l.insert(i,1)
        else:
            l.remove(i)
            l.insert(i,1)
print(cnt+1)