#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long N = 1e5 + 10;
const long long mod = 1e9 + 7;
const long long inf = -1e18;
const long long INF = 1e18;
long long n, a[N], us[N];
set<long long> ans;
void solve() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    us[i] = i;
  }
  sort(a + 1, a + n + 1);
  for (int i = n; i >= 1; i--) {
    for (int j = i - 1; j >= 1; j--) {
      if (a[j] < a[i] && us[j] == j) {
        us[j] = us[i];
        break;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    ans.insert(us[i]);
  }
  cout << ans.size();
}
int main() {
  solve();
  return 0;
}
