123-sequence

2000ms

262144K

Description:

There is a given sequence of integers a₁, a₂, ..., 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.

Input:

The first line contains an integer n (1 ≤ n ≤ 10⁶). The second line contains a sequence of integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 3).

Output:

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

Sample Input:

9
1 3 2 2 2 1 1 2 3

Sample Output:

Note:

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

Informação

Provedor Codeforces

Código CF52A