#include <bits/stdc++.h>
using namespace std;
const long long int inf = LLONG_MAX;
int main() {
  int n, a[5005];
  cin >> n;
  set<int> my;
  for (long long int i = 1; i <= n; i++) cin >> a[i], my.insert(i);
  sort(a + 1, a + n + 1);
  int l, r;
  l = 1;
  r = 2;
  while (r <= n && l < n) {
    while (a[l] >= a[r] && r <= n) r++;
    if (r > n) {
      cout << my.size();
      return 0;
    }
    my.erase(r);
    l++;
    while (my.find(r) == my.end() && r <= n) r++;
  }
  cout << my.size();
  return 0;
}
