A. Polycarp's Pockets-优快云博客

Polycarp需要将不同价值的硬币分配到口袋中，每个口袋不能有相同价值的硬币。本篇介绍了一个算法解决方案，通过输入硬币数量及各自的价值，计算出分配所需的最少口袋数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Polycarp's Pockets

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp has nn coins, the value of the ii-th coin is aiai. 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]a=[1,2,4,3,3,2], he can distribute the coins into two pockets as follows: [1,2,3],[2,3,4][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.

Input

The first line of the input contains one integer nn (1≤n≤1001≤n≤100) — the number of coins.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1001≤ai≤100) — values of coins.

Output

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.

Examples

input

6
1 2 4 3 3 2

output

input

1
100

output

#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    int a[110];
    cin>>n;
    fill(a,a+110,0);
    for(int i=0;i<n;++i){
        int x;
        cin>>x;
        a[x]++;
    }
    sort(a+1,a+101);
    cout<<a[100]<<endl;
    return 0;
}