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 main():
    n = int(input())
    L = list(map(int, input().split()))
    D = {}
    for i in range(n):
        a = L[i]
        if a in D:
            D[a] += 1
        else:
            D[a] = 1
    if D[1] >= D[2] and D[1] >= D[3]:
        print(n - D[1])
    elif D[2] >= D[1] and D[2] > D[3]:
        print(n - D[2])
    else:
        print(n - D[3])
            
        
main()