#include <algorithm>

using namespace std;

int n;

int r[100005];

int a[100005];

int main(){

	freopen("duel.in ","r",stdin);

	freopen("duel.out","w",stdout);

	cin >> n;

	for(int i = 1;i <= n;i++) cin >> r[i];

	sort(r + 1, r + n + 1);

	int x = 0;

	r[0] = -1;

	for(int i = 1;i <= n;i++){

		if(r[i] != r[i - 1]) a[++x] ++;

		else a[x] ++;

	}

	int cnt = a[1];

	for(int i = 2;i <= x;i++){

		if(a[i] >= cnt) cnt = a[i];	

	}

	cout << cnt;

	fclose(stdin);

	fclose(stdout);

	return 0;

}