#include <bits/stdc++.h>
using namespace std;
map<long long, int> mp;
int main() {
  int n;
  cin >> n;
  long long a[n];
  int max1 = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    mp[a[i]]++;
    max1 = max(max1, mp[a[i]]);
  }
  sort(a, a + n);
  int count1 = 0;
  for (int i = 0; i < n - 1; ++i) {
    if (a[i] != a[i + 1]) count1++;
  }
  cout << max1;
  return 0;
}
