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())
b = list(map(int, input().split()))
x=0
y=0
z=0
t=[]
for i in range(len(b)):
  if b[i]==1:
    x+=1
  if b[i]==2:
    y+=1
  if b[i]==3:
    z+=1
t.append(x)
t.append(y)
t.append(z)
print(a-max(t))