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).
s = input()
s = raw_input()
L = []
while(s.find(" ") != -1):
        L.append(int(s[:s.find(" ")]))
        s = s[s.find(" ")+1:]

L.append(int(s))

a1 = L.count(1)
a2 = L.count(2)
a3 = L.count(3)

max1 = max(a1, a2, a3)

print(len(L) - max1)
