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 = int(input())
a = list(map(int, input().split()))

counts = {}

for num in a:
    if num in counts:
        counts[num] += 1
    elif len(counts) < 2:
        counts[num] = 1

if len(counts) == 1:
    print(0)
else:
    num1, num2 = counts.keys()
    count1, count2 = counts.values()
    min_replacements = n - max(count1, count2)
    print(min_replacements)