rt.

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 1e5 + 10;

int n, a[MAXN], cnt[MAXN], mx[MAXN];
vector<int> v;

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    cnt[a[i]]++;
  }
  for (int i = 1; i < MAXN; i++) {
    if (cnt[i]) {
      v.push_back(cnt[i]);
    }
  }
  for (int i = 0; i < v.size(); i++) {
    mx[i] = v[i];
  }
  int ans = n;
  for (int i = 0; i < v.size(); i++) {
    for (int j = i + 1; j < v.size(); j++) {
      if (v[i] <= mx[j]) {
        ans -= v[i];
        mx[j] -= v[i];
        v[i] = 0;
        break;
      } else {
        ans -= mx[j];
        v[i] -= mx[j];
        mx[j] = 0;
      }
    }
  }
  cout << ans;
  return 0;
}

悬两关