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 f():
    n=int(input())
    a=list(map(int,input().split()))
    if(a.count(1)+a.count(2)<=a.count(1)+a.count(3) and a.count(1)+a.count(2)<=a.count(2)+a.count(3)):
        ans=n-a.count(3)
    elif(a.count(1)+a.count(3)<=a.count(1)+a.count(2) and a.count(1)+a.count(3)<=a.count(2)+a.count(3)):
        ans=n-a.count(2)
    elif(a.count(2)+a.count(3)<=a.count(1)+a.count(2) and a.count(2)+a.count(3)<=a.count(1)+a.count(3)):
        ans=n-a.count(1)
        
    print(ans)
f()