#include<stdio.h>
int a[101],b[101],l[101],prec[101],n;
void solve(){
    int i,j,max=0,max2=0,poz,k;
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
        scanf("%d",&a[i]);
    for(i=1; i<=n; ++i){
        k=0;
        //max=0;
        //max2=0;
        for(j=1; j<i; ++j)
            if(a[j]<a[i]){
                ++k;
                if(l[j]>max)
                    max=j;
                l[i]=k;
                if(l[i]>max2){
                    max2=l[i];
                    poz=i;}
                prec[i]=j;}}
    b[max2]=a[poz];
    for(i=max2-1; i>0; --i){
        b[i]=a[prec[poz]];
        poz=prec[poz];}
    printf("%d\n",max2);
    for(i=1; i<=max2; ++i)
        printf("%d ",b[i]);}
int main(){
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    solve();
    return 0;}