#include <fstream>

using namespace std;

const int N = 100000;

int x[1+N], lung[1+N], val_min[1+N];

ifstream in("scmax.in");
ofstream out("scmax.out");

void refac_subsirul(int p, int val, int l)///val = valoarea ultimului termen gasit
{
    if (l == 1)///am gasit deja toti termenii subsirului
    {
        return;
    }
    if (x[p] < val && lung[p] == l - 1)///daca x[p] e urmatorul element al subsirului
    {
        refac_subsirul(p - 1, x[p], lung[p]);
        out << x[p] << " ";
    }
    else
    {
        refac_subsirul(p - 1, val, l);
    }
}

int caut_bin(int v[], int n, int val)
{
    int st=1, dr=n, rez=0;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(v[m]<val)
        {
            rez=m;
            st=m+1;
        }
        else dr=m-1;
    }
    return rez;
}

int main()
{
    int n, pmax = 1, n_val_min = 0;
    in >> n;
    for (int i = 1; i <= n; i++)
        in >> x[i];
    for (int i = 1; i <= n; i++)
    {
        int j0 = caut_bin(val_min, n_val_min, x[i]);
        if(j0==n_val_min)
            n_val_min++;
        lung[i]=j0+1;
        val_min[lung[i]]=x[i];
        if(lung[i]>lung[pmax])
            pmax=i;
    }
    out << lung[pmax] << "\n";
    refac_subsirul(pmax, x[pmax] + 1, lung[pmax] + 1);
    in.close();
    out.close();
    return 0;
}