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())
space = input()
Max = 0
arr = [int(item) for item in input().split(' ')]
dict = dict.fromkeys(arr, 0)

for value in arr:
    if dict[value] == 0:
        dict[value] = 1
    else:
        dict[value] += 1

for val in dict.values():
    if Max < val:
        Max = val


print(len(arr) - Max)
