#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n;
int best[100003],a[100003], Max,sol=0,poz[100003],p,i,j;

int main()
{
    fin>>n;
    for(i=1;i<=n;++i)
        fin>>a[i];
    best[n]=1;
    poz[n]=-1;
    Max=1;
    p=n;
    for(i=n-1;i>0;--i)
    {
        best[i]=1;
        poz[i]=-1;
        for(j=i+1;j<=n;++j)
            if(a[i]<a[j] && best[i]<best[j]+1)
        {
            best[i]=best[j]+1;
            poz[i]=j;
            if(best[i]>Max)
            {
                Max=best[i];
                p=i;
            }
        }
    }
    i=p;
    fout<<Max<<'\n';
    while(i!=-1)
    {
        fout<<a[i]<<" ";
        i=poz[i];
    }
    return 0;
}