#include <cstdio>
#include <algorithm>
#define N 100002
#define zeros(x) ((x)&(-x))
using namespace std;

struct nr
{
    int x, y;
};

nr a[N], b[N];
int aib[N], d[N], nxt[N];

bool comp(nr r, nr t)
{
    return r.x>t.x;
}

void update(int i, int val)
{
    for(;i<=N;i+=zeros(i))
    {
        if(d[val]>d[aib[i]])
        {
            aib[i]=val;
        }
    }
}

int query(int i)
{
    int ret=0;
    for(;i>0;i-=zeros(i))
    {
        if(d[aib[i]]>ret)
        {
            ret=aib[i];
        }
    }
    return ret;
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    int n, i, k=0, sol=0, soli=0;
    scanf("%d", &n);
    for(i=1;i<=n;i++)
    {
        scanf("%d", &a[i].x);
        b[i].x=a[i].x;
        b[i].y=i;
    }
    sort(b+1, b+n+1, comp);
    for(i=1;i<=n;i++)
    {
        if(b[i].x!=b[i-1].x) k++;
        a[b[i].y].y=k;
    }
    for(i=n;i>0;i--)
    {
        nxt[i]=query(a[i].y-1);
        d[i]=d[nxt[i]]+1;
        if(d[i]>sol)
        {
            sol=d[i];
            soli=i;
        }
        update(a[i].y, i);
    }
    printf("%d\n", sol);
    if(sol) for(i=soli;i>0&&i<=n;i=nxt[i])
    {
        printf("%d ", a[i].x);
    }
}