#include <bits/stdc++.h>
int p[100];
int main() {
  int n, a[100], cnt = 1, max = 0;
  scanf("%d", &n);
  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]) a[j] ^= a[j + 1] ^= a[j] ^= a[j + 1];
    }
  }
  if (a[0] - a[n - 1] == 0) {
    printf("%d\n", n);
    return 0;
  }
  int j = 0;
  for (int i = 0; i < (n - 1); i++) {
    if (a[i] == a[i + 1])
      p[j] = ++cnt;
    else {
      cnt = 1;
      j++;
    }
  }
  for (int i = 0; i <= j; i++) {
    if (max < p[i]) max = p[i];
  }
  if (max == 0) {
    printf("1\n");
    return 0;
  }
  printf("%d\n", max);
  return 0;
}
