#include <algorithm>
using namespace std;

#define DIM 100005

int v[DIM],bst[DIM],t[DIM];
int n,sol,ind;

void read ()
{
    int i;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
        scanf ("%d",&v[i]);
    sol=ind=1;
}

inline int cbin (int val)
{
    int st,dr,mij;

    for (st=0, dr=sol; st<=dr; )
    {
        mij=(st+dr)>>1;
        if (mij==dr || (v[bst[mij]]<val && v[bst[mij+1]]>=val))
            return mij;
        else if (v[bst[mij]]<val)
            st=mij+1;
        else
            dr=mij-1;
    }
    return 0;
}

void print (int poz)
{
    if (t[poz])
        print (t[poz]);
    printf ("%d ",v[poz]);
}

void solve ()
{
    int i,poz;

    bst[1]=1;
    for (i=2; i<=n; ++i)
    {
        poz=cbin (v[i]);
        t[i]=bst[poz];
        bst[poz+1]=i;
        if (poz+1>sol)
        {
            sol=poz+1;
            ind=i;
        }
    }
    printf ("%d\n",sol);
    print (ind);
}

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

    read ();
    solve ();

    return 0;
}