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.

The first line contains an integer $n$ ( $1<=n<=10^{6}$ ). The second line contains a sequence of integers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=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.