#include <iostream>#define N 10005using namespace std;int a[N],n;int f( int x){	int i,t;	if (x==0) return 1;                //第一个元素 下标为0 	for (t=0,i=0;i<x; i++)             //下标不为0    		if (a[x]>=a[i]) t=max(f(i)+1,t);     //  f(i)+1此时的长度+1，，，，t 原来的长度	return t; }int main(int argc, char *argv[]){	int i,j;	cin>>n;	for (i=0;i<n; i++)		 cin>>a[i];	cout<<f(n-1)<<endl;	return 0;}

#include <iostream>#define N 10005using namespace std;int a[N],n;int f( int x){	int i,t;	if (x==0) return 1;	for (t=0,i=0;i<x; i++)		if (a[x]>a[i]) t=max(f(i),t);	return t+1; }int main(int argc, char *argv[]){	int i,j;	cin>>n;	for (i=0;i<n; i++)		 cin>>a[i];	cout<<f(n-1)<<endl;	return 0;}

#include <iostream>
#define N 10005
using namespace std;
int a[N],n;
int f( int x)
{ int i,t;
 if (x<=0) return 1;
 t=1;
 for (i=0;i<x; i++)
  if (a[x]>a[i]) t=max(f(i)+1,t);                 //  f(i)+1此时的长度+1，，，，t 原来的长度
                                                                           // 有时候对，有时候不对
 return t;
}
int main(int argc, char *argv[])
{ int i,j;
 cin>>n;
 for (i=0;i<n; i++)
   cin>>a[i];
 cout<<f(n-1)<<endl;

 return 0;
}