#include <bits/stdc++.h>
using namespace std;
int a[5005];
int main() {
  int n, i, frmax, fract;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  frmax = 1;
  fract = 1;
  for (i = 2; i <= n; i++) {
    if (a[i] != a[i - 1]) {
      frmax = max(frmax, fract);
      fract = 1;
    } else
      fract++;
  }
  frmax = max(frmax, fract);
  cout << frmax << '\n';
  return 0;
}
