#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int check(int p) {
  int i = 0, j = p + 1, k = 0;
  while ((i <= p) && (j < n)) {
    if (a[i] < a[j])
      k++, i++, j++;
    else
      j++;
  }
  return k;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  a.resize(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  int ans = 0;
  vector<int> used(n);
  int r = 1;
  for (int i = 0; i < n; i++) {
    while ((r < n) && ((a[r] <= a[i]) || (used[r]))) r++;
    if (r != n) used[r] = 1, ans++;
  }
  cout << n - ans;
  return 0;
}
