#include <cstdio>
#include <algorithm>
using namespace std;

inline int next_int() {
	int d;
	scanf("%d", &d);
	return d;
}

int N, A[1 << 18], BIT[1 << 18], LIS[1 << 18];
pair<int, int> S[1 << 18];

int get(int index) {
	int ans = 0;
	while (index > 0) {
		ans = max(ans, BIT[index]);
		index -= index & -index;
	}
	return ans;
}

void set(int index, int value) {
	while (index < 1 << 18) {
		BIT[index] = max(value, BIT[index]);
		index += index & -index;
	}
}

bool cmp(const pair<int, int>&p1, const pair<int, int>&p2) {
	if (p1.first != p2.first) {
		return p1.first < p2.first;
	}
	return p2.second < p1.second;
}

int main() {
	freopen("scmax.in", "r", stdin);
	freopen("scmax.out", "w", stdout);
	N = next_int();
	for (int i = 1; i <= N; i++) {
		A[i] = next_int();
		S[i] = make_pair(A[i], i);
	}
	sort(S + 1, S + N + 1, cmp);
	for (int i = 1; i <= N; i++) {
		int value = S[i].first;
		int index = S[i].second;
		int mx = get(index);
		LIS[index] = mx + 1;
		set(index, mx + 1);
	}
	printf("%d ", get(N));
	return 0;
}