#include <bits/stdc++.h>
using namespace std;
const int N = 5007;
int n;
bool used[N];
int b[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  sort(b, b + n);
  int l = 0, r = n - 1;
  int ans = 0;
  for (int i = n - 1; i >= 1; i--) {
    if (used[i])
      continue;
    else
      ans++;
    used[i] = true;
    int last = b[i];
    for (int j = i - 1; j >= 0; j--) {
      if (used[j]) continue;
      if (last == b[j])
        continue;
      else
        used[j] = true;
      last = b[j];
    }
  }
  for (int i = 0; i < n; i++)
    if (!used[i]) ans++;
  cout << ans << endl;
  return 0;
}
