//实质求严格上升子序列的长度,动态规划
#include<algorithm>
int a[1000], dp[1000];
int main(void)
{
int n,ans=1;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
dp[i] = 1;
for (int j = 0; j < i; j++)
{
if (a[j] < a[i]) dp[i] =std:: max(dp[i], dp[j]+1);
}
ans = std::max(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}