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).
#n, m = map(int, input().split())
ot = 0
n = int(input())
f = list(map(int, input().split()))
p1 = f.count(1)
p2 = f.count(2)
p3 = f.count(3)
if max(p1, p2, p3) == p1:
    ot = p2 +p3
if max(p1, p2, p3) == p2:
    ot = p1+p3
if max(p1, p2, p3) == p3:
    ot = p2+ p1
print(ot)