#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, maxi = INT_MIN;
  cin >> n;
  vector<int> arr(n);
  for (i = 0; i < n; i++) cin >> arr[i];
  unordered_map<int, int> um;
  unordered_map<int, int>::iterator im;
  for (i = 0; i < n; i++) {
    im = um.find(arr[i]);
    if (im == um.end())
      um.insert({arr[i], 1});
    else
      (im->second)++;
  }
  for (im = um.begin(); im != um.end(); im++) {
    if ((im->second) > maxi) maxi = (im->second);
  }
  cout << maxi << endl;
}
