1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N = 5*1e5+5;
vector<int> occ(N,0), num;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

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

	for (auto u: occ){
		if (u){
			num.pb(u);
		}
	}

	sort(num.begin(),num.end(),greater<int>());

	if (num.size() == 2){
		if (num[0] == num[1])
			cout << "2\n";
		else
			cout << "1\n";
		return 0;
	}
	
	int res = 0;
	while (n > 0){
		n -= 2*num[res]-1;
		res ++;
	}
	cout << res << "\n";

	return 0;
}