#include<cstdio>
#include<cmath>
#include<climits>
#include<algorithm>
#include<sstream>
#include<iostream>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<list>
#include<map>
#include<vector>

using namespace std;


#define rep(i,n) for(int i=0; i<n; i++)
#define rept(i,a,b) for(int i=a; i<b; i++)
#define ll long long

#define IMIN INT_MIN;
#define IMAX INT_MAX;


int main(){
	int N;
	cin >> N;
	vector<int> H(N);

	sort(H.begin(), H.end());

	int cnt = 1;
	int st = H[N-1];

	for(int i=N-2, i>0, i--) {
		if (st <= H[i]) {
			cnt++;
			st = H[i];
		}
		else break;
	}

	cout << cnt << endl;




	return 0;
}

