#include <cstdio>
#include <algorithm>
#define NMAX 100005

using namespace std;

struct{
    int lc, elem;
}b[NMAX];

long int a[NMAX], n;

void citire()
{
    scanf("%ld", &n);
    for(int i=0;i<n;i++)
        scanf("%ld ", &a[i]);
}

int maxim(int i)
{
    int maxi=0;
    for(int j=n-1;j>i;j--)
        if(a[i]<a[j] && b[i].lc<b[j].lc+1)
             maxi=b[j].lc;
    return maxi;
}

void ordonare(int nr)
{
    for(int i=1;i<=nr-1;i++)
        for(int j=i+1;j<=nr;j++)
            if(b[i].elem<b[j].elem)
            {
                int aux=b[i].elem;
                b[i].elem=b[j].elem;
                b[j].elem=aux;
            }
}

void generare()
{
    int lmax=0;
    a[n]=0;
    for(int i=n-1;i>=0;i--)
    {
        b[i].lc=maxim(i)+1;
        b[i].elem=a[i];
        if(lmax<b[i].lc)
            lmax=b[i].lc;
    }
    printf("%d\n", lmax);

    ordonare(lmax);
    for(int i=lmax;i>=1;i--)
        printf("%ld ", b[i].elem);
}

int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);

    citire();
    generare();
    return 0;
}