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).
x=int(input())
z=list( input().split())
y=z.count("3")
a=z.count("2")
s=z.count("1")
if (y>=a and y>s) or (y>a and y>=s):
    print(len(z)-y)
elif (a>=y and a>s) or (a>y and a>=s):
    print(len(z)-a)
elif (a==y and a==s) or (a==y and a==s):
    print(len(z)-a)
else:print(len(z)-s)    
