#include <iostream>
#include <cstring>
#include <cmath>
#include <fstream>
using namespace std;

ifstream fin("subsir2.in");
ofstream fout("subsir2.out");

const int mod = 9901;
int dp[1002], a[1002], n, ant[1002];

int main()
{
	int i, j;
	cin >> n;
	for (i = 1; i <= n; i++)
		cin >> a[i];
	for (i = 1; i <= n; i++)
		dp[i] = 5000;
	dp[1] = 1;
	for (i = 2; i <= n; i++)
		for (j = 1; j < i; j++)
			if (a[j] < a[i] && dp[j] < dp[i])
			{
				dp[i] = dp[j];
				ant[i] = j;
			}
	fout << dp[n];
	int pos, mn = 5000;
	return 0;
}