#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define nmax 100005
#define val first
#define pos second
using namespace std;

int H[4*nmax];
int v[nmax], dp[nmax];
int n, sol;

pair <int, int> sorted[nmax];

void update(int node, int lo, int hi, int pos, int val) {
	if(lo == hi) {
		H[node] = val;
		return;
	}

	int mid = (lo + hi) >> 1;
	if(pos <= mid) update(2*node, lo, mid, pos, val);
	else update(2*node+1, mid+1, hi, pos, val);

	H[node] = max(H[2*node], H[2*node+1]);
}

void query(int node, int lo, int hi, int a, int b) {
	if(a <= lo && hi <= b) {
		sol = max(sol, H[node]);
		return;
	}

	int mid = (lo + hi) >> 1;
	if(a <= mid) query(2*node, lo, mid, a, b);
	if(mid < b)  query(2*node, mid+1, hi, a, b);
}

int main() {
	ifstream f("scmax.in");
	ofstream g("scmax.out");

	f>>n;
	for(int i=1; i<=n; i++) f>>v[i], sorted[i] = make_pair(v[i], i);
	sort(sorted+1, sorted+n+1);
	
	//for(int i=n-1; i>=1; i--)
	//	if(sorted[i].val == sorted[i+1].val) sorted[i].pos = sorted[i+1].pos;

	for(int i=n; i>=1; i--) {
		//calculez dp-ul pentru sorted[i].pos
		sol = 0;
		query(1, 1, n, sorted[i].pos + 1, n);

		dp[sorted[i].pos] = sol + 1;
		update(1, 1, n, dp[sorted[i].pos], sol+1);
	}

	sol = 0;
	for(int i=1; i<=n; i++) sol = max(sol, dp[i]);//cout<<dp[i]<<" "; cout<<"\n";
	g<<sol<<"\n";

	return 0;
}