#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;
int n, a;
map<int, int> input;
vector<int> nums;

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a;
		input[a]++;
	}

	map<int, int>::iterator it;
	for (it = input.begin(); it != input.end(); ++it) {
		nums.push_back(it->second);
	}
	sort(nums.begin(), nums.end(), greater<int>());

	int result = 0;
	int sum_smallest = 0;
	int visited = 0;
	for (int i = 0, j = nums.size() - 1; i < nums.size() && i <= j;) {
		int current_element = nums[i];
		if (i == j) {
			result++;
			break;
		}
		if (nums[j] + sum_smallest >= current_element) {
			result++;
			sum_smallest = 0;
			i++;
		}
		else {
			j--;
			sum_smallest += nums[j];
		}
	}
	cout << result;
	return 0;
}