#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

int a[100010],l[100010],t[100010];

int main()
{
    priority_queue<int>q;
    ifstream fin("scmax.in");
    ofstream fout("scmax.out");
    int n,i,j,maxim,imax,lmax=0,lmaxi;
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
        maxim=1;
        imax=0;
        for(j=1;j<i;j++)
            if(a[i]>a[j]&&maxim<=l[j])
            {
                maxim=l[j]+1;
                imax=j;
            }
        l[i]=maxim;
        t[i]=imax;
        if(l[i]>lmax)
        {
            lmax=l[i];
            lmaxi=i;
        }
    }
    fout<<lmax<<"\n";
    int p=0;
    for(i=lmaxi;i;i=t[i])
        l[++p]=a[i];
    for(i=p;i>=1;i--)
        fout<<l[i]<<" ";
    return 0;
}