#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> m(n);
  for (int i = 0; i < n; ++i) cin >> m[i];
  sort(m.begin(), m.end());
  int ans = 1;
  int count = 1;
  for (int i = 1; i < n; ++i) {
    if (m[i] == m[i - 1])
      ++count;
    else
      count = 1;
    ans = max(ans, count);
  }
  cout << ans << '\n';
  return 0;
}
