#include <bits/stdc++.h>
using namespace std;
#define N 100010
int x[N];

int main()
{
	int n, cnt = 0;
	int i = 0, p, q;

	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> x[i];

	sort(x, x + n);

	p = 0;
	q = lower_bound(x, x + n, x[p] + 1) - x;

	while (q < n)
	{
		if (x[q] > x[p])
		{
			cnt++;
			p++;
		}
		q++;

	}


	cout << n - cnt << endl;

	return 0;
}