#include<bits/stdc++.h>
using namespace std;
const int N=1e5+2;
int n,cnt=0,l;
priority_queue<int, vector<int>, greater<int> > dcl,q;
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin >> n;
	for (int i = 1;i <= n; i++){
		cin >> l;
		q.push(l);	
	} 	
	while( !q.empty() ){
		dcl.push( q.top() );
		q.pop();
		if(q.top() > dcl.top() && !dcl.empty() && !q.empty()){
			//cout<<q.top()<<" "<<dcl.top()<<endl; 
			dcl.pop();
		} 
	}
	while(!dcl.empty()){
		cnt++;
		dcl.pop();
	}	
	cout << cnt << endl;
	return 0;
}