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