#include <bits/stdc++.h>
int cmp(const void *aa, const void *bb) { return *((int *)aa) - *((int *)bb); }
int main() {
  int n;
  scanf("%d", &n);
  int a[5000];
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  qsort(a, n, sizeof(int), cmp);
  int c = 0;
  int b[5000], k = 10000, r = 2;
  while (k > 0) {
    k = 0;
    for (int i = 0; i < n - 1; i++)
      if (a[i] == a[i + 1]) b[k++] = a[i];
    n = k;
    for (int i = 0; i < k; i++) a[i] = b[i];
    c++;
  }
  printf("%d\n", c);
  return 0;
}
