/*Se da un sir cu n elemente numere naturale.
Sa se determine lungimea celui mai lung subsir crescator din sir, apoi elementele subsirului respectiv*/
///PROGRAMARE DINAMICA
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long sir[100000],a;
long long n, i, j, x[100000], l[100000], ant[100000], maxx, lmax, pmax;
int main()
{
    f>>n;
    for (i=1;i<=n;i++)
        f>>x[i];

    for(i=1;i<=n;i++)
    {   lmax=0;
        ant[i]=0;
        for(j=1;j<=i-1;j++)
            if(x[i]>x[j] && l[j]>lmax)
            {   lmax=l[j];
                ant[i]=j;
            }
        l[i]=1+lmax;
        if(maxx<l[i])
        {   maxx=l[i];
            pmax=i;
        }
    }
    /*for(i=1;i<=n;i++)
        cout<<ant[i]<<' ';*/
    g<<maxx<<endl; //lungimea celui mai lung subsir crescator din sir
    a=0;
    for(i=pmax;i>=1;i=ant[i])
        {   a++;
            sir[a]=x[i];
        }
    for(i=a;i>=1;i--)
        g<<sir[i]<<" ";
    return 0;
}