#include <bits/stdc++.h>
using namespace std;
int arr[5005];
int vis[5005] = {0};
int main(void) {
  int N;
  scanf("%d", &N);
  for (int i = 0; i < N; i++) scanf("%d", arr + i);
  sort(arr, arr + N);
  int ans = 0;
  while (1) {
    int S = N - 1;
    while (S >= 0 && vis[S]) S--;
    if (S == -1) break;
    int tmp = 0x7f7f7f7f;
    while (S >= 0) {
      if (!vis[S] && arr[S] < tmp) {
        tmp = arr[S];
        vis[S] = 1;
      }
      S--;
    }
    ans++;
  }
  printf("%d\n", ans);
}
