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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define rep(i, a, b) for(int i = a; i < (b); ++i)

#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define ssize(x) int(x.size())

#define pb push_back
#define fi first
#define se second
#define ld long double

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

using LL=long long;

#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

void solve() {
    int N;
    cin >> N;
    
    vector<int> a(N);
    REP(i, N) cin >> a[i];
    sort(all(a));

    vector<pii> comb;

    int cnt = 1;
    for (int i = 1; i < N; i++) {
        if (a[i] != a[i - 1]) {
            comb.pb({a[i-1], cnt});
            cnt = 1;
        }
        else {
            cnt++;
        }
    }

    comb.pb({a[N-1], cnt});

    sort(all(comb), [&] (auto x, auto y) {
        return x.se < y.se;
    });

    int ans = 1;
    int i = 0, j = comb.size() - 1;

    while (i < j) {
        int ile = comb[j].se - 1;

        // Zostaly nam juz tylko pojedyncze grupy
        ans += (ile == 0);

        while (i < j && ile > 0) {
            // ile jeszcze mozemy dobrac
            int how_much = min(ile, comb[i].se);

            comb[i].se -= how_much;
            ile -= how_much;

            // jezeli wyczerpalismy to idziemy dalej
            if (comb[i].se == 0)
                i++;
            
            // jezeli nie mozemy dobierac i nie nie skonczyly
            // nam sie jeszcze grupy to zwieksz wynik
            if (ile == 0 && i != j)
                ans++;
        }

        j--;
    }

    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}