#include <fstream>
#define K 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[K],T[K],D[K],n,i,j,u,p,maxim;
void afis(int x){
    if(x>0){
        afis(T[x]);
        fout<<v[x]<<" ";
    }
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    v[++n]=1000000000;
    ///D[i]= lg celui mai lung sir care se termina in v[i]
    ///T[i]=indicele din care am obtinut D[i]
    D[1]=1;
    for(i=1;i<=n;i++){
        maxim=p=0;
        for(j=1;j<i;j++)
            if(v[j]<v[i] && D[j]>maxim){
                maxim=D[j];
                p=j;
            }
        D[i]=maxim+1;
        T[i]=p;
    }
    fout<<D[n]-1<<"\n";
    afis(T[n]);
    return 0;
}