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

stack = []

n = int(input())

arr = [int(i) for i in input().split(" ", n-1)]

ones = arr.count(1)
twos = arr.count(2)
threes = arr.count(3)

stack.append(1)

if twos>ones:
    stack.append(2)
    if threes>twos:
        stack.append(3)
elif threes>ones:
    stack.append(3)

print(n-arr.count(stack.pop()))
