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).
t = int(input())
a = list(map(int , input().split()))
c1 = 0 
c2 = 0 
c3 = 0 
for el in a:
    if(el == 1):
        c1 += 1 
    elif(el == 2):
        c2 += 1 
    else:
        c3 += 1 

print((c1+c2+c3)-max(c1,c2,c3)) 