#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  long long n, a[5001], cnt = 1, maxn = 0;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n - 1; i++) {
    if (a[i] == a[i + 1]) cnt++;
    if (a[i] != a[i + 1]) cnt = 1;
    maxn = max(maxn, cnt);
  }
  maxn = max(maxn, cnt);
  cout << maxn;
  return 0;
}
