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 = int(input())
b = [int(x) for x in input().split()]
list_ = []
m = 0

c = list(set(b))
d = len(c)

if d == 1:
    print(0)
else:

    for i in c:
        m = b.count(i)
        list_.append(m)
        m = 0
    e = list_.index(max(list_))
    gr_ = c[e]
    print(len(b)-b.count(gr_))