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).
alist=[1,3,2,2,2,1,1,2,3]
c=len(alist)
n1=0
n2=0
n3=0
for i in range(0,c):
    if alist[i]==1:
        n1=n1+1
    elif alist[i]==2:
        n2=n2+1
    elif alist[i]==3:
        n3=n3+1
print(n1,n2,n3)
a=max(n1,n2,n3)
print(c-a)
