#include <fstream>
using namespace std;

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

void Read();
void Solve();

int a[1000], L[1000], n, Lmax;

int main()
{
	Read();
	Solve();
	fin.close();
	fout.close();
	return 0;
}

void Read()
{
	fin >> n;
	for ( int i = 1; i <= n; i++ )
			fin >> a[i];
}

void Solve()
{
	for ( int i = 0; i < n; i++ )
	{
		L[i] = 1;
		for ( int j = 0; j < i; j++ )
			if ( L[j] + 1 > L[i] && a[j] < a[i] )
				L[i] = L[j] + 1;
	}
	for ( int i = 0; i < n - 1; i++ )
		if ( L[i] > L[i + 1] )
			Lmax = L[i];
		else 
			Lmax = L[i + 1];
	fout <<  Lmax; 	
}