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).
numlist = []
for _ in range(int(input())):
  numlist.append(int(input()))


def find_most_occurring(n):
  onecount = 0
  twocount = 0
  threecount = 0
  for i in n:
    if i == 1:
      onecount+=1
    elif i ==2:
      twocount += 1
    elif i ==3:
      threecount+=1
  if onecount>twocount and onecount>threecount:
    return twocount+threecount
  if twocount>onecount and twocount>threecount:
    return onecount+threecount
  if threecount>onecount and threecount>twocount:
    return twocount+onecount


x = find_most_occurring(numlist)
print(x)