#include <fstream>
#include <iostream>
using namespace std;
 
#define in "subsir2.in"
#define out "subsir2.out"
#define N 100005
 
int v[N], bst[N], tata[N], MAX, last[N], nr = 1, n;
 
ofstream fout (out);
 
void write (int k) {
    if (tata[k])
        write (tata[k]);
    fout << v[k] << " ";
}
 
int BS (int x) {
    int lo = 0, hi = nr;
    while (lo <= hi) {
        int mid = (lo + hi) >> 1;
        if (v[last[mid]] < x && v[last[mid+1]] >= x)
            return mid;
        else
            if (v[last[mid+1]] < x)
                lo = mid + 1;
        else
            hi = mid - 1;
    }
    return nr;
}
 
int main () {
    ifstream fin (in);
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    fin.close();
    bst[1] = last[1] = 1; 
    last[0] = 0;
    for (int i = 2; i <= n; ++i) {
        int c = BS (v[i]);
        tata[i] = last[c];
        bst[i] = c + 1;
        last[c + 1] = i;
        if (nr < c + 1)
            nr = c + 1;
    }
    fout << nr << "\n";
    write (last[nr]);
    fout.close();
    return 0;
}