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).
inp = input().split()
check = {'1':0, '2':0, '3':0}
def ad(x, n):
    if n > 0:
        i=x[0]
        check[i]+=1
        ad(x[1:], n-1)
ad(inp, 9)
if check['1'] > check['2'] and check['1'] > check['3']:
    print(check['2'] + check['3'])
if check['2'] > check['1'] and check['2'] > check['3']:
    print(check['1'] + check['3'])
if check['3'] > check['2'] and check['3'] > check['1']:
    print(check['2'] + check['1'])