#include<fstream>
#define min(a,b) ((a<b)?a:b)
using namespace std;
#define MAXLEN 100005
int sir[MAXLEN];
int vals[MAXLEN];
int len=0;
int last;

int binary_search(int val,int N)
{
    int i, step;
    for (step = 1; step < N; step <<= 1);
    for (i = 0; step; step >>= 1)
        if (i + step < N && vals[i + step] <= val)
            i += step;
    return i;
}

void func(int N)
{
    vals[0]=sir[0];len=1;
    for(int i=1;i<N;i++)
    {
        int poz=binary_search(sir[i],len);
        if( sir[i]>vals[poz] && vals[poz+1]==0)
        {
            vals[++poz]=sir[i];len++;last=i;
        }
        else if (vals[poz] < sir[i] && vals[poz+1]!=0)
                vals[poz + 1] = min(vals[poz + 1], sir[i]);
        else if(vals[poz]>sir[i])
                vals[poz]=min(vals[poz], sir[i]);

    }
}

int main() {
    int N;
    fstream f, g;
    f.open("scmax.in", ios::in);
    g.open("scmax.out", ios::out);
    f >> N;
    for (int i = 0; i < N; i++) {
        f >> sir[i];
    }
    func(N);
    g << len << endl;
    for(int i=0;i<N;i++)
        vals[i]=0;
    int aux=last;
    len=0;last=0;
    func(aux+1);

    for(int i=0;i<len;i++)
        g<<vals[i]<<" ";
}