//determinarea celui mai lung subsir dintr-un vector

#include<iostream>

using namespace std;

int main()
{
	int v[100000];
	int dp[100000];
	int n,i,j;
	cout<<"n=";cin>>n;
	//int tata[100];
	for (i=1;i<=n;++i)
	{
		cout<<"v["<<i<<"]=";cin>>v[i];
	}
	int max=0;
	dp[0]=0;
	for (i=1;i<=n;++i)
	{
		dp[i]=1;
		tata[i]=0;
		for (j=i-1;j;--j)
			if (v[i] >= v[j])
				break;
		if (j!=0)
		{
			dp[i]=dp[j]+1;
			//tata[i]=j;
			if (dp[max]<dp[i])
				max=i;
		}
	}
	//cout<<tata[max]<<endl;
	cout<<endl<<dp[max];
	
	return 0;
}