#include <bits/stdc++.h>
using namespace std;
vector<int> used, a;
int main() {
  int n;
  cin >> n;
  used.resize(n);
  a.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    used[i] = 0;
  }
  sort(a.begin(), a.end());
  reverse(a.begin(), a.end());
  for (int i = 0; i < n; i++) {
    if (used[i] == 1) continue;
    int now = a[i];
    for (int j = i + 1; j < n; j++) {
      bool x = ((now == a[j]) || (used[j] == 1)), y = now == a[j];
      if (x) {
        continue;
      }
      now = a[j];
      used[j] = 1;
    }
  }
  int k = 0;
  for (int i = 0; i < n; i++) {
    if (used[i] == 0) k++;
  }
  cout << k;
  return 0;
}
