#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

long long n, v[100002], ln[100002], poz[100002];
int maxl = -1, maxp;
priority_queue < pair <int, int> > Q;

int main () {
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    int i , j;
    for (i = n; i > 0; i--) {
        if (not Q.empty()) {
            if (v[i] < v[Q.top().second]) {
                ln[i] = Q.top().first + 1;
                poz[i] = Q.top().second;
            }
        }
        else {
            for (j = i+1, poz[i] = -1, ln[i] = 1; j <= n; j++) {
                if (v[i] < v[j] and ln[i] < ln[j] + 1) {
                    ln[i] = ln[j] + 1;
                    poz[i] = j;
                }
            }
        }
        Q.push(make_pair(ln[i], i));
    }

   /*for (int i = 1; i <= n; i++) {
    if (ln[i] > maxl) {
        maxl = ln[i];
        maxp = i;
    }
   }*/
    fout << Q.top().first << '\n';
    for (i = Q.top().second; i != -1; i = poz[i]) {
        fout << v[i] << " ";
    }
}