#include <bits/stdc++.h>
using namespace std;
int ar[50001];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i <= n - 1; i++) cin >> ar[i];
  sort(ar, ar + n);
  int ans = 1;
  int prev = -1;
  int count = 0;
  for (int i = 0; i <= n - 1; i++) {
    if (prev == ar[i]) {
      count++;
      ans = max(ans, count);
    } else {
      prev = ar[i];
      count = 1;
    }
  }
  cout << ans << endl;
  return 0;
}
