#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn];
struct node {
  int x;
  node(int x) : x(x) {}
  int operator<(const node a) const { return x > a.x; }
};
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a + n);
  priority_queue<node> q;
  int ans = 1;
  q.push(node(a[0]));
  for (int i = 1; i < n; i++) {
    if (q.top().x < a[i]) {
      q.pop();
      q.push(node(a[i]));
    } else {
      q.push(node(a[i]));
      ans++;
    }
  }
  printf("%d\n", ans);
  return 0;
}
