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())
numbers = input()
ones, twos, threes, ans = 0, 0, 0, 0

for i in range(len(numbers)):
    if numbers[i] == '1':
        ones += 1
    elif numbers[i] == '2':
        twos += 1
    elif numbers[i] == '3':
        threes += 1

if ones > twos and ones > threes:
    ans = twos + threes
elif twos > ones and twos > threes:
    ans = ones + threes
else:
    ans = ones + twos

print(ans)
