#include <bits/stdc++.h>
using namespace std;
struct pos {
  int h, w;
};
bool comp(pos l, pos p) { return l.h < p.h; }
int main() {
  int n, m;
  pos a[5000];
  cin >> n;
  int kol = n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].h;
    a[i].w = 0;
  }
  sort(a, a + n, comp);
  for (int i = 0; i < n - 1; i++)
    for (int j = i + 1; j < n; j++) {
      if (a[i].h != a[j].h && a[i].w != 1 && a[j].w != 2) {
        kol--;
        a[i].w = 1;
        a[j].w = 2;
      }
    }
  cout << kol;
}
