#include <fstream>
using namespace std;

ifstream f ("scmax.in");
ofstream g ("scmax.out");

int v[100001], L[100001];

int main ()
{
    int i, j, l, lmax = -1, max, n, p;
    f>>n;
    for (i=0; i<n; i++) f>>v[i];
    L[n-1] = 1;
    for (i=n-2; i>=0; i--)
    {
        max = 0;
        for (j=i+1; j<n; j++)
            if(v[i]<v[j] && L[j]>max)
                max = L[j];
        L[i] = max + 1;
        if (L[i]>lmax) lmax = L[i];
    }

    g<<lmax<<'\n';

    for (i=0; i<n; i++)
        if (L[i] == lmax)
        {
            p = i;
            g<<v[i]<<' ';
            break;
        }

    for (l=lmax-1; l>=1; l--) ///luam cautarea invers
        for (i=p; i<n; i++)
            if (L[i]==l && v[p]<v[i])
            {
                p = i;
                g<<v[i]<<' ';
                break;
            }

    f.close(); g.close(); return 0;
}