#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	int size;
	std::cin >> size;
	std::vector<int> numbers;
	numbers.reserve(size);
	for (int i = 0; i < size; i++) {
		int tmp;
		std::cin >> tmp;
		numbers.push_back(tmp);
	}
	std::unordered_map<int, int> numberCounts;
	for (auto num : numbers) {
		numberCounts[num]++;
	}
	std::vector<int> counts;
	for (auto entry : numberCounts) {
		counts.push_back(entry.second);
	}
	std::sort(counts.begin(), counts.end(), std::greater<int>{});
	int result{0};
	int cumulativeSum{0};
	for (auto i : counts) {
		cumulativeSum += (i * 2 - 1);
		result++;
		if (cumulativeSum >= size) {
			std::cout << result << "\n";
			break;
		}
	}

	return 0;
}