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():
    o = 0
    t = 0
    th = 0
    n = int(input())
    token = input().split()
    for x in token:
        if int(x) == 1:
            o+= 1
        elif int(x) == 2:
            t+=1
        else:
            th+=1
    if o >= t and o >= th:
        print(n-0)
    elif t >= t and t >= th:
        print(n-t)
    else:
        print(n-th)
    
main()
    