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
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define FOR(x, b, e) for(int x = (b); x <= (e); ++(x))
#define FORD(x, b, e) for(int x = (b); x >= (e); --(x))
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(a, b) for (auto&a : (b))
#define PB push_back
#define PF push_front
#define MP make_pair
#define ST first
#define ND second
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;

template <typename T>
std::ostream& operator<<(std::ostream &output, const vector<T> &vec)
{
    output << "[";
    FOREACH(x, vec) output << x << ", ";
    output << "]";
    return output;
}

template <typename T, typename U>
std::ostream& operator<<(std::ostream &output, const pair<T,U> &p)
{
    output << "(";
    output << p.ST << ", " << p.ND;
    output << ")";
    return output;
}


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

  int N; cin >> N;
  int res=0;
  vi cnt(N+1);
  vi A(N);
  REP(i, N) {
    cin >> A[i];
    cnt[A[i]]++;
  }

  sort(ALL(A), [&](int a, int b) {return cnt[a] < cnt[b] || (cnt[a]==cnt[b] && a < b);});

  int mx = SIZE(A)-1;
  int mn = 0;
  while (N > 0) {
    int leader = A[mx]; 
    int k=0;
    FORD(i, mx, mn) {
      if (A[i] == leader)
        k++;
      else
        break;
    }
    mx -= k;
    
    int k2 = min(mx-mn+1, k-1);
    mn += k2;
    
    N -= k + k2;
    res++;
  }

  cout << res << endl;
}