#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
int main() {
	std::ios_base::sync_with_stdio(0);
	std::cin.tie(0);
	int n, x;
	int res = 0;
	std::cin >> n;
	std::map<int, int> m;
	for (int i = 0; i < n; i++) {
		std::cin >> x;
		m[x]++;
	}
	//std::cout << m.size();
	std::map<int, int>::iterator itr;
	std::vector<int> w(m.size());
	int i = 0;
	for (itr = m.begin(); itr != m.end(); itr++) {
		w[i] = (*itr).second;
		i++;
	}
	std::sort(w.begin(), w.end());
	int j = 0;
	i = w.size() - 1;
	int a = 0, b = 0;
	while (true) {
		if (j == i + 1) {
			if (a < b) res++;
			std::cout << res;
			exit(0);
		}
		if (a <= b) {
			a += w[i]; i--; a--;
			res++;
		}
		else {
			b += w[j]; j++;
		}
		
	}
	return 0;


}