#include <bits/stdc++.h>
using namespace std;
long long ct[100005];
int dx[4] = {0, 0, -1, 1};
int dy[4] = {1, -1, 0, 0};
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first == b.first) return a.second > b.second;
  return a.first < b.first;
}
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  bool vis[n];
  memset(vis, 1, sizeof(vis));
  for (int i = 1; i < n; i++) {
    for (int j = i - 1; j >= 0; j--) {
      if (vis[j] && a[i] > a[j]) {
        vis[j] = 0;
        break;
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++)
    if (vis[i]) ans++;
  cout << ans;
  return 0;
}
