#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;

vector<int> v;


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

	cin >> n;
	vector<int> c(n);
	for (int i = 0; i < n; i++) {
		cin >> c[i];	
	}
	v.push_back(c[0]);
	for (int i = 1; i < n; i++) {
		auto iter = lower_bound(v.begin(), v.end(), c[i]);
		if (iter == v.end()) {
			v.push_back(c[i]);
		}
		else if (iter < v.end()) {
			*iter = c[i];
		}
	}

	cout << v.size();

	return 0;
}