#include <bits/stdc++.h>
using namespace std;
int main() {
  long n;
  cin >> n;
  long arr[n];
  for (long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  long counter = 0;
  long maxi = 0;
  for (long i = 0; i < n - 1; i++) {
    if (arr[i] == arr[i + 1]) {
      counter++;
    } else {
      counter++;
      if (counter > maxi) {
        maxi = counter;
      }
      counter = 0;
    }
  }
  if (arr[n - 1] == arr[n - 2]) {
    counter++;
    if (counter > maxi) {
      maxi = counter;
    }
  } else {
    counter = 1;
    if (counter > maxi) {
      maxi = counter;
    }
  }
  cout << maxi << endl;
}
