1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
#define int ll
//#define N
using namespace std;
int n,a[500005];
void BellaKira()
{
	int ans=0;
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		a[x]++;
	}
	sort(a+1,a+n+1);
	for (int i=n,j=1;i>=j;i--)
	{
		if (i==j)
		{
			ans++;
			break;
		}
		int x=a[i];
		while (j<i)
		{
			if (x>a[j])
			{
				x-=a[j];
				j++;
			} else
			{
				a[j]-=x-1;
				break;
			}
		}
		ans++;
	}
	cout<<ans<<'\n';
		
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}