#include <iostream>

#include <cstdio>

using namespace std;

const int N = ;

int n,ans;

int a[N],f[N];

int main() {

    scanf("%d",&n);

    for(int i=; i<=n; i++) {

        scanf("%d",&a[i]);

        f[i]=;

        for(int j=i-; j>=; j--)

            if(a[i]>a[j])

                f[i]=max(f[i],f[j]+);

    }

    for(int i=; i<=n; i++) ans=max(ans,f[i]);

    printf("%d",ans);

    return ;

}

#include <iostream>

#include <cstdio>

#include <cmath>

#include <cstring>

using namespace std;

const int po[] = {

    ,,,,,,,,

    ,,,,,

    ,,,,

};

int m,dp[];

int main() {

    scanf("%d",&m);

    memset(dp,0x7f,sizeof(dp));

    dp[]=;

    for(int i=; i<=; i++)

        for(int j=po[i]; j<=m; j++)

            dp[j]=min(dp[j],dp[j-po[i]]+);

    printf("%d",dp[m]);

    return ;

}