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())
lst = list(map(int, input().split()))

ones = 0
twos = 0
threes = 0

for x in lst:
    if x == 1:
        ones += 1
    elif x == 2:
        twos += 1
    else:
        threes += 1
ontw = ones + twos
twth = twos + threes
thon = threes + ones

print(min(ontw,twth,thon))