#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
int n, m;
int value[40005], dp[40005];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> value[i];
	}
	int res = 0;
	dp[0] = value[0];

	for (int i = 1; i < n; i++) {
		if (dp[res] < value[i]){
			dp[++res] = value[i];
		}
		else {
			int index = lower_bound(dp, dp + res, value[i]) - dp;
			dp[index] = value[i];
		}
	}

	cout << res + 1;

	return 0;
}