//njudge
#include<bits/stdc++.h>
using namespace std;
#define DBG

int main() {
	int n;cin>>n;
	vector<int> sor(n);
	for(int i=0;i<n;i++) {
		cin>>sor[i];
		#ifdef DBG
		cerr<<"I'm debugging with the shopping cart\n";
		#endif
	}
	map<int,int> lengths;
	#ifdef DBG
	cerr<<"map init ok\n";
	#endif
	for(int i=0;i<n;i++) {
		
		#ifdef DBG
		cerr<<i<<' ';
		#endif
		
		auto pos=lengths.lower_bound(sor[i]);
		
		#ifdef DBG
		cerr<<(*pos).first;
		cerr<<' ';
		#endif
		
		//for(auto it=pos;pos!=lengths.end()&&it!=lengths.end();it++) {
		if(pos!=lengths.end()) {
			#ifdef DBG
			cerr<<"f\n";
			#endif
			auto it=pos;
			(*it).second++;
		}
		
		#ifdef DBG
		cerr<<sor[i]<<'\n';
		#endif
		
		if(lengths[sor[i]]==0) lengths[sor[i]]=1;
		
	}
	int mx=-1;
	for(pair<int,int> e : lengths) {
		mx=max(mx,e.second);
		
		#ifdef DBG
		cerr<<e.first<<' '<<e.second<<'\n';
		#endif
	}
	cout<<mx;
	return 0;
}