// 如果不用scanf,用cout,就会TLE,1000MS变成了421MS
//贪心,实质求连续多次求最长严格上升子序列,循环次数就是所求的最少broomstick
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int bs[3000];
int main(void)
{
int n,cur,m;
while (cin >> n)
{
if (!n) cout << 1 << endl;
else
{
m = 0;
for (int i = 0; i < n; i++)
{
scanf("%d", &bs[i]);
}
sort(bs, bs + n);
int nn = n;
while (nn)
{
for (int i = 0; i < n; i++)
{
if (bs[i] != -1)
{
cur = bs[i];
bs[i] = -1;
nn--;
for (int j = i + 1; j < n; j++)
{
if (bs[j] > cur&&bs[j] != -1)
{
cur = bs[j];
bs[j] = -1;
nn--;
}
}
m++;
}
}
}
cout << m << endl;
}
}
return 0;
}
//贪心,实质求等级相同的元素的最多个数
//265MS
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int bs[3000],max,n,count;
while (cin >> n)
{
if (!n) cout << 1 << endl;
else
{
for (int i = 0; i < n; i++)
{
scanf("%d", &bs[i]);
}
sort(bs, bs + n);
max = 1, count = 1;
for (int i = 1; i < n; i++)
{
if (bs[i] > bs[i - 1]) count = 1;
else
{
count++;
max = count > max ? count : max;
}
}
cout << max << endl;
}
}
return 0;
}
//577MS
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int bs[3000], max, n, count;
while (cin >> n)
{
if (!n) cout << 1 << endl;
else
{
for (int i = 0; i < n; i++)
{
scanf("%d", &bs[i]);
}
sort(bs, bs + n);
max = -1;
for (int i = 0; i < n; i++)
{
count = upper_bound(bs, bs + n, bs[i]) - lower_bound(bs, bs + n, bs[i]);
max = count > max ? count : max;
}
cout << max << endl;
}
}
return 0;
}