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).
import sys

n_nums = int(sys.stdin.readline())
values = [int(x) for x in sys.stdin.readline().split()]

one, two, three = 0, 0, 0
for i in values:
    if i == 1:
        one += 1
    if i == 2:
        two += 1
    if i == 3:
        three += 1

result = one + two + three - max(one, two, three)
print(result)
