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 = lst.count(1)
    b = lst.count(2)
    c = lst.count(3)
    if a > b and a > c:
        return len(lst) - a
    elif b > a and b > c:
        return len(lst) - b
    elif c > a and c > b:
        return len(lst) - c
    elif a == b == c:
        return len(lst) - a


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