#include<bits/stdc++.h> 
using namespace std;
int n, ans = 0;
struct node{
	int x, y, z;	//x:武力值  y:是否攻击  z:是否出局
}s[1000005];
bool cmp(node A, node B){
	return A.x < B.x; 
}
int main()
{
    cin >> n;
    for(int i = 0;i < n;i++){
    	int a;	cin >> a;
    	s[i] = {a, 0, 0};
	}
	sort(s, s+n, cmp);
	int i = 0, j = 0;
	while(s[i].x >= s[j].x)	j++;
	
	for(i = 0;i < n, j < n;i++){
		if(s[i].x >= s[j].x)	while(s[i].x >= s[j].x)	j++;
		if(s[i].x < s[j].x && !s[i].z && !s[j].y)
			s[i].z = 1, s[j].y = 1, j++;
		
	}
	for(i = 0;i < n;i++)	if(!s[i].z )	ans++;
	cout << ans;
    return 0;
}