CF1003A.Polycarp's Pockets

Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket.

For example, if Polycarp has got six coins represented as an array $a = [1, 2, 4, 3, 3, 2]$, he can distribute the coins into two pockets as follows: $[1, 2, 3], [2, 3, 4]$.

Polycarp wants to distribute all the coins with the minimum number of used pockets. Help him to do that.

波利卡普有 $n$ 枚硬币，第 $i$ 枚硬币的面值为 $a_i$。波利卡普希望将所有硬币分配到他的口袋中，但不允许将面值相同的两枚硬币放入同一个口袋。

例如，若波利卡普有六枚硬币，表示为数组 $a = [1, 2, 4, 3, 3, 2]$，则他可以将硬币分配到两个口袋中，如下所示：$[1, 2, 3], [2, 3, 4]$。

波利卡普希望用最少数量的口袋来完成全部硬币的分配。请帮助他实现这一目标。

The first line of the input contains one integer $n$ ($1 \le n \le 100$) — the number of coins.

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 100$) — values of coins.

输入的第一行包含一个整数 $n$（$1 \le n \le 100$）—— 表示硬币的数量。

输入的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 100$）—— 表示各硬币的面值。

Print only one integer — the minimum number of pockets Polycarp needs to distribute all the coins so no two coins with the same value are put into the same pocket.

仅输出一个整数——Polycarp 所需的最少口袋数量，使得所有硬币都能被分配，且任意两个面值相同的硬币不会被放入同一个口袋。