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).
def sequence(lst):
    a = [0, 0, 0]
    for elem in lst:
        if elem == 1:
            a[0] += 1
        elif elem == 2:
            a[1] += 1
        else:
            a[2] += 1
    return len(lst) - max(a)


n = int(input())
b = [int(i) for i in input().split()]
print(sequence(b))
