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).
# n = int(input())
# cont = [int(item) for item in input().split(' ')]
# num = {}
#
# for item in cont:
#     num[item] += 1
#
# st = {num[1], num[2], num[3]}
# print(st[0] + st[1])

n = int(input())
cont = [0, 0, 0]
for it in [int(item) for item in input().split(' ')]:
    cont[it - 1] += 1

cont.sort()
print(cont[0] + cont[1])