Problem Statement

There are $N$ balls. Each ball is painted in one of $N$ colors: color $1$ through color $N$. The color of the $i$-th ball $(1\le i\le N)$ is $C_i$.

In one operation, you can change the color of any one ball to any of the $N$ colors.

Find the minimum number of operations required to make all the balls the same color.

Constraints

• $1\le N\le 100$
• $1\le C_i\le N$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

$N$
$C_1$ $C_2$ $\ldots$ $C_N$

Output

Output the answer.

4
3 1 2 1

2

By changing the color of the first ball to $1$ and the color of the third ball to $1$, you can make all the balls the same color.

It is impossible to make all the balls the same color by changing the colors of fewer than two balls, so output $2$.

5
3 3 3 3 3

0

All balls may have the same color from the beginning.

9
4 2 3 3 4 1 2 7 1

7

• 来源：AtCoder ABC 470 B