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).
n=int(input("enter any integer"))
a[]
c1,c2,c3=0,0,0
for(i=0;i<n;i++):
    a[i]=int(input("enter only 1,2or3"))
for(i=0;i<n;i++):
    if(a[i]==1):
        c1+=1
    elif(a[i]==2):
        c2+=1
    else:
        c3+=1
c=n-max(c1,max(c2,c3))
print(c)
