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).
k=int(input())
b=list(map(int, input().split()))
f1 = b.count(1)
f2 = b.count(2)
f3 = b.count(3)

if f1 >= f2 and f1 >= f3:
    k= 1
elif f2 >= f1 and f2 >= f3:
    k= 2
else:
    k= 3
count = sum(1 for i in b if i != k)
print(count)
