#include <iostream>
#include <algorithm>
using namespace std;

int main ()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n;
	cin >> n;
	int t[n + 1] = { 0 };
	
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		t[x]++;
	}
	
	sort(t, t + n + 1);
	
	int l = 0, p = n, odp = 0;
	while (l <= n && t[l] == 0) {
		l++;
	}
	while (l <= p) {
		while (t[p] != 0) {
			if (t[l] < t[p]) {
				t[p] -= t[l];
				l++;
			} else {
				t[l] -= t[p];
				t[p] = 0;
			}
		}
		
		odp++;
		p--;
	}
	
	cout << odp;
	return 0;
}