#include <iostream>
#include <algorithm>
int i, j, size = 0, length[100005] = { 0 }, in[100005], best;

int main()
{
	freopen("scmax.in", "r", stdin);
	freopen("scmax.out", "w", stdout);
	scanf("%d", &size);

	for (i = 0; i < size; i++)	scanf("%d", &in[i]);

	length[0] = 1;
	for (int i = 0; i < size;i++)
	{
		best = 1;
		for (j = i - 1; j >= 0; --j)
		{
			if (in[j]<in[i] && length[j] + 1>best)
			{
				best = length[j] + 1;
			}
		}
		length[i] = best;
	}

	best = 0;
	for (int i = 0; i < size; i++) if (length[i]>best) best = length[i];

	printf("%d", best);
	
}