#include <fstream>
#include <iostream>
using namespace std;

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

int n, v[100001], parent[100001], bin[100001], max_len = 0;

void print_reverse(int k){
    if(parent[k] == -1){
        fout<<v[k]<<" ";
        return;
    }

    print_reverse(parent[k]);

    fout<<v[k]<<" ";
}

int main()
{
    fin>>n;

    for(int i=1; i<=n; i++) fin>>v[i];

    max_len = 1;
    bin[1] = 1;
    parent[1] = -1;

    for(int i=2; i<=n; i++){

        if(v[bin[max_len]] < v[i]){
            bin[++max_len] = i;
            parent[i] = bin[max_len - 1];
        }
        else if(v[bin[1]] >= v[i]){
            bin[1] = i;
            parent[i] = -1;
        }
        else {
            int step, k;
            for(step = 1; step < max_len; step = (step << 1));

            for(k = max_len; step; step = (step >> 1))
                if(k - step > 0 && v[i] <= v[bin[k - step]] ) k -= step;

            bin[k] = i;
            parent[i] = bin[k-1];

        }
    }

    fout<<max_len<<"\n";
    print_reverse(bin[max_len]);
}