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).
p=int(input())
t=input()
m=t.split()
m=list(map(int,m))
a=max(m.count(1),m.count(2),m.count(3))
print(len(m)-a)
# if m.count(1)<m.count(2)<m.count(3) or m.count(2)<m.count(1)<m.count(3)   :
#     print(len(m)-m.count(3))
# elif m.count(2)<m.count(3)<m.count(1)or m.count(3)<m.count(2)<m.count(1)   :
#     print(m.count(m[2])+m.count(m[1])) 
# elif m.count()<m.count(m[2]<m.count(m[1])) or m.count(m[2])<m.count(m[0])<m.count(m[1])   :
#     print(m.count(m[2])+m.count(m[0]))   