AT_abc470_b.Monocolor

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.

有 $N$ 个球。每个球被涂成 $N$ 种颜色之一：颜色 $1$ 至颜色 $N$。第 $i$ 个球 $(1\le i\le N)$ 的颜色为 $C_i$。

每次操作中，你可以将任意一个球的颜色更改为 $N$ 种颜色中的任意一种。

求使所有球颜色相同的最少操作次数。

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

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

输入从标准输入给出，格式如下：

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

Output the answer.

输出答案。

Sample 1 Explanation:
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$.

Sample 2 Explanation:
All balls may have the same color from the beginning.

Constraints

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

样例 1 解释：
通过将第一个球的颜色改为 $1$，并将第三个球的颜色改为 $1$，可以使所有球颜色相同。

无法通过修改少于两个球的颜色使所有球颜色相同，因此输出 $2$。

样例 2 解释：
所有球在初始时可能已经具有相同的颜色。

约束条件

• $1\le N\le 100$
• $1\le C_i\le N$
• 所有输入值均为整数。