#include <iostream>
#include <vector>

using namespace std;

vector<int> count_sort(vector<int> v) {
	vector<int> count(v.size() + 1);
	vector<int> o(v.size());

	for (int i = 0; i < v.size(); i++) {
		count[v[i]]++;
	}
	int i = 0;
	for (int number = v.size(); number >= 1; number--) {
		for (int j = 0; j < count[number]; j++) {
			o[i] = number;
			i++;
		}
	}

	return o;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, input;
	cin >> n;
	vector<int> count(n + 1);

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

	vector<int> o = count_sort(count);

	int i = 0, left = n, splits = 0;

	while (left > 0) {
		left -= 2 * o[i] - 1;
		splits++;
		i++;
	}

	cout << splits;
}