#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, res = 1;
  cin >> n;
  int arr[n];
  vector<int> s(100);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  if (n == 1)
    cout << 1;
  else {
    for (int i = 0; i <= n + 1; i++) {
      if (arr[i] == arr[i + 1])
        res += 1;
      else {
        s.push_back(res);
        res = 1;
      }
    }
    cout << *max_element(s.begin(), s.end());
  }
  return 0;
}
