CF52A.123-sequence

There is a given sequence of integers _a_1, _a_2, ..., a__n, 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.

给定一个整数序列 $a_1, a_2, \dots, a_n$，其中每个数均属于 $\{1, 2, 3\}$。你需要替换最少数量的数，使得序列中所有数都相等。

The first line contains an integer n (1 ≤ n ≤ 106). The second line contains a sequence of integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 3).

第一行包含一个整数 $n$（$1 \leq n \leq 10^6$）。第二行包含一个整数序列 $a_1, a_2, \dots, a_n$（$1 \leq a_i \leq 3$）。

Print the minimum number of replacements needed to be performed to make all the numbers in the sequence equal.

输出使序列中所有数字相等所需执行的最少替换次数。

In the example all the numbers equal to 1 and 3 should be replaced by 2.

在示例中，所有等于 1 和 3 的数字都应被替换为 2。