#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<algorithm>
#include<cmath>
#include<iomanip>

using namespace std;
using ll = long long;
using ull = unsigned long long;

int main()
{
	int n; cin >> n;
	vector<int> v(n, 0);
	for (int i = 0; i < n; i++)
	{
		int x; cin >> x;
		v[x - 1]++;
	}
	sort(v.begin(), v.end());
	int amount = 0;
	while (n > 0)
	{
		n -= (2 * v.back() - 1);
		v.pop_back();
		amount++;
	}
	cout << amount << endl;
}