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
#include <unistd.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <deque>
#include <iostream>
#include <algorithm>

// using namespace std;
#define REP(i, n) for (int _n = (n), i = 0; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define TRACE(x) cerr << "TRACE(" #x ")" << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << endl;
typedef long long LL;
typedef unsigned long long ULL;
using VINT = std::vector<int>;
using VLL = std::vector<LL>;
using VULL = std::vector<ULL>;


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

  VLL vll1;
  int n, a;
  std::cin >> n;
  vll1.resize(n, 0);
  for (int i = 0; i < n; i++)
  {
    std::cin >> a;
    vll1[--a]++;
  }
  std::sort(vll1.rbegin(), vll1.rend());

  int sum = 0;
  int i = 0;
  for (auto v : vll1) {
    if (sum >= n) break;
    sum += v - 1;
    n -= v;
    i++;
  }

  std::cout << i << std::endl;

  return 0;
}