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

int main()
{
	int n;
	std::cin >> n;
	std::vector<int> arr;
	int num;
	for (int i = 0; i < n; i++)
	{
		std::cin >> num;
		arr.push_back(num);
	}

	std::map<int, int> ord_nums;
	for (int i : arr)
	{
		ord_nums[i]++;
	}

	std::vector<int> values;
	for (auto m : ord_nums)
	{
		values.push_back(m.second);
	}

	std::sort(values.begin(), values.end(), std::greater<int>());

	int res = 1;

	int i = 0;
	int j = values.size() - 1;
	while (i < j)
	{
		int s = values[j];
		while (values[i] > s)
		{
			j--;
			s += values[j];
		}
		i++;
		if (i <= j)
			res++;
	}

	std::cout << res;

	return 0;
}