#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fi first
#define se second

const int MAXN = 5e5 + 7;



int solve(){
	
	int n, x;
	cin >> n;
	
	vector<int> cnt(MAXN, 0);
	int maks = 0;
	
	for(int i = 1; i <= n; i++){
		
		cin >> x;
		cnt[x]++;
	}
	
	vector<int> v;
	for(int i = 1; i <= n; i++) if(cnt[i] > 0) v.push_back(cnt[i]);
	sort(v.begin(), v.end());
	deque<int> dq;
	for(int u : v) dq.push_back(u);
	
	int ans = 0;
	
	while(!dq.empty()){
		
		ans++;
		int akt = dq.back();
		dq.pop_back();
		
		while(!dq.empty() && akt - dq.front() > 0){
			
			akt -= dq.front();
			dq.pop_front();
		}
		
		if(!dq.empty()) dq.front() -= (akt - 1);
	}

	return ans;
}


signed main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cout << solve() << '\n';
	
	return 0;
}