#include <bits/stdc++.h>
int main() {
  int n;
  scanf("%d", &n);
  int a[5005], ans = 1, max = 0;
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 1; i < n; i++)
    for (int j = 0; j < n - i; j++)
      if (a[j] > a[j + 1]) {
        int t = a[j];
        a[j] = a[j + 1];
        a[j + 1] = t;
      }
  for (int i = n - 1; i >= 0; i--) {
    if (a[i] == a[i - 1])
      ans++;
    else {
      if (ans > max) {
        max = ans;
      }
      ans = 1;
    }
  }
  if (max == 0)
    printf("1\n");
  else
    printf("%d\n", max);
  return 0;
}
