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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>

typedef long long int lli;

using namespace std;

#define MAX4 10010
#define MAX5 100010
#define MAX6 1000010

#define FOR(n) for (int i = 0; i < n; i++)

using vti = vector<int>;
using vts = vector<string>;

template <typename T> void dbg(T last) { cout << last << "\n"; }

template <typename T, typename... args> void dbg(T current, args... next) {
  cout << current << ' ';
  dbg(next...);
}

template <typename T> void getInput(vector<T> &v, int n, int x = 0) {
  for (int i = x; i < n; i++) {
    cin >> v[i];
  }
}

//-----------------------------------------------------------------------------------------------//

void solve() {
  int n;
  cin >> n;
  vti v(n);
  vti cnt(n + 1);

  getInput(v, n);
  for (int x : v) {
    cnt[x]++;
  }
  vti vs;
  for (int i = 1; i <= n; i++) {
    if (cnt[i]) {
      vs.push_back(cnt[i]);
    }
  }

  sort(vs.begin(), vs.end());
  deque<int> d;
  int ans = 0;
  for (int x : vs) {
    d.push_back(x);
  }
  while (!d.empty()) {
    int cur = d.back();
    cur--;
    d.pop_back();
    ans++;
    while (!d.empty()) {
      int x = d.front();
      d.pop_front();
      if (cur > x) {
        cur -= x;
      } else {
        int rest = x - cur;
        if (rest) {
          d.push_front(rest);
        }
        break;
      }
    }
  }
  cout << ans << "\n";
}

int main() {
  std::ios::sync_with_stdio(false);

  solve();

  return 0;
}