#include <fstream>
using namespace std;
ifstream fin("subsir2.in");
ofstream fout("subsir2.out");
int main()
{
	int a[100], i, j, L[100], n, maxim = -99999;
	fin >> n;
	for ( i = 0; i < n; i++ )
		fin >> a[i];
	for ( i = 0; i  < n; i++ )
	{
		L[i] = 1;
		for ( j = 0; j < i; j++ )
			if ( L[j] + 1 > L[i] && a[i] > a[j] ) 
				L[i] = L[j] + 1;
	}
	for ( i = 0; i < n; ++i )
	if ( maxim < L[i] )
		maxim = L[i];

	fout << maxim << '\n';
	fin.close();
	fout.close();
	return 0;
}