#include <stdio.h>
#include <algorithm>
using namespace std;
FILE*f=fopen("scmax.in","r");
FILE*g=fopen("scmax.out","w");
#define NMax 100005
int AIB[NMax],D[NMax];
int i,n,h=1,bst;
void update(int x,int ind)
{
    for (;x<=n;x+=x&-x)
        if (D[ind]>D[AIB[x]])
            AIB[x]=ind;
}
int query(int x)
{
    int mx=0;
    for (;x;x-=x&-x)
        if (D[AIB[x]]>D[mx])
            mx=AIB[x];
    return mx;
}
int main()
{
    #define Nmax 100005
    int v[NMax],aux[NMax],unice[NMax],up[Nmax];
    aux[0]=v[0]=unice[0]=up[0]=0;
    fscanf(f,"%d",&n);
    for (i=1;i<=n;i++)
    {
        fscanf(f,"%d",&v[i]);
        aux[i]=unice[i]=v[i];
    }
    sort(unice+1,unice+n+1);
    for (i=2;i<=n;i++)
        if (unice[h]!=unice[i]) unice[++h]=unice[i];
    for (i=1;i<=n;i++)
        v[i]=lower_bound(unice+1,unice+h+1,v[i])-unice;
    for (i=1;i<=n;i++)
    {
        up[i]=query(v[i]-1);
        D[i]=D[up[i]]+1;
        update(v[i],i);
        if (D[bst]<D[i]) bst=i;
    }
    fprintf(g,"%d\n",D[bst]);
    for (h=0,i=bst;i;i=up[i])
        unice[++h]=aux[i];
    for (i=h;i;i--) fprintf(g,"%d ",unice[i]);
    return 0;
}