#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j = 1, c = 1;
  cin >> n;
  int b[n + 1];
  int a[n + 1];
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << "1";
  } else {
    sort(a + 1, a + n + 1);
    for (i = 1; i <= n - 1; i++) {
      if (a[i] == a[i + 1])
        c++;
      else {
        b[j] = c;
        j++;
        c = 1;
      }
    }
    if (a[n - 1] = a[n]) {
      b[j] = c;
    }
    int p = 0;
    for (i = 1; i <= j; i++) {
      p = max(p, b[i]);
    }
    cout << p;
  }
}
