#include <bits/stdc++.h>
#define NMAX 100004
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int lgmax[NMAX],a[NMAX],urm[NMAX];
int n,i,j,maxim,urmator,pozmax;
//fct
void citire();

int main()
{
    citire();
///in mod bottom-up
///sufix
    lgmax[n-1]=1;
    urm[n-1]=-1;///initial are 1 elem si nu urmeaza nimeni
    for(i=n-2; i>=0; i--)
    {
        maxim=1;
        urmator=-1;//intial pp ca e singur
        for(j=i+1; j<n; j++)//analizem sufixuri calculate
            if(a[i]<a[j] && 1+lgmax[j]>maxim)//daca il pot alipi si e convenabil(obtin maxim axtual)
            {
                maxim=1+lgmax[j];
                urmator=j;
            }
        lgmax[i]=maxim;
        urm[i]=urmator;
    //l-am aranjat
    }
//gata, acum afisam
maxim=lgmax[0]; pozmax=0;
for(i=1;i<n;i++)
    {
     if(maxim<lgmax[i])
        {
         maxim=lgmax[i];pozmax=i;
        }
    }
fout<<maxim<<'\n';
fout<<a[pozmax]<<" ";
while(urm[pozmax]!=-1)
    {
     pozmax=urm[pozmax];
     fout<<a[pozmax]<<" ";
    }
fout<<'\n';

    return 0;
}
void citire()
{
    int i;
    fin>>n;
    for(i=0; i<n; i++)
        fin>>a[i];
}