#include <bits/stdc++.h>
using namespace std;
const int maxn = 5 * 1000 + 10;
long long f[maxn], t;
int main() {
  long long n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> f[i];
  sort(f, f + n);
  for (int i = n - 1; i >= 0; i--) {
    int p = f[i];
    if (p == -1) continue;
    for (int j = i; j >= 0; j--) {
      if (f[j] != -1 && f[j] < p) {
        p = f[j];
        f[j] = -1;
        t++;
      }
    }
  }
  cout << n - t << endl;
  return 0;
}
