#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e3 +10;
int n;
int a[N], f[N];
int main()
{
cin >> n;
for(int i = 0; i < n; i ++ ) cin >> a[i];
int mx = 1;
for(int i = 0; i < n ; i ++)
{
f[i] = 1;
for(int j = 0; j < i; j ++ )
{
if(a[i] > a[j])
f[i] = max(f[i], f[j] + 1);
}
mx = max(f[i], mx);
}
cout << mx << endl;
return 0;
}