const int maxn = 1e6 + 5;
int n, a[maxn];
int dp[maxn];

void solve(){
    memset(dp, 0, sizeof(dp));
    dp[0] = 0; a[0] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < i; j++){
            if(a[j] < a[i] && dp[j] + 1 > dp[i]){
                dp[i] = dp[j] + 1;
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) ans = max(ans, dp[i]);
    printf("%d\n", ans);
}
int main(){
    while(scanf("%d", &n) != EOF){
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
        solve();
    }
}