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).
a=input()
b=str(input())
kot=[]
ct1=0
ct2=0
ct3=0
for i in b:
    if b!=' ':
        kot.append(i)
for i in kot:
    if i=='1':
        ct1++
    if i= '2':
        ct2++
    if i=='3':
        ct3++
print(a-max(ct1,ct2,ct3)) 
    