#include <iostream>
#include <cstdio>
#define N 100005

using namespace std;

int n, a[N], s1[N], s2[N], lg;

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

int caut(int x)
{
    int st=1, dr=n, poz=-1;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(s1[mij]==x)
        {
            poz=mij;
            dr=mij-1;
        }
        else
            if(s1[mij]<x)
                st=mij+1;
            else
            {
                poz=mij;
                dr=mij-1;
            }
    }
    return poz;
}

void parcurg()
{
    for(int i=0;i<n;i++)
    {
        int poz=caut(a[i]);
        if(poz==-1)
        {
            s1[++s1[0]]=a[i];
            s2[i]=s1[0];
        }
        else
        {
            s1[poz]=a[i];
            s2[i]=poz;
        }
    }
    printf("%d\n", s1[0]);
}

void subsir(int i)
{
    if(i==-1)
        return;
    if(s2[i]==lg)
    {
        lg--;
        subsir(i-1);
        printf("%d ", a[i]);
    }
    subsir(i-1);
}

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

    citire();
    parcurg();
    lg=s1[0];
    subsir(n-1);
    return 0;
}