#include <algorithm>
using namespace std;

#define DIM 100005

int best[DIM],t[DIM],v[DIM];
int n,best_lg,ind;

void read ()
{
    int i;

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

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

    for (st=0, dr=best_lg; st<=dr; )
    {
        mij=(st+dr)/2;
        if (mij==dr || (v[best[mij]]<val && val<=v[best[mij+1]]))
            return mij;
        else if (v[best[mij]]<val)
            st=mij+1;
        else
            dr=mij-1;
    }
    return 0;
}

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

void solve ()
{
    int i,poz;

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

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

    read ();
    solve ();

    return 0;
}