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

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

const int MAXN = 1e5 + 5;
const int INF = 2e9 + 1;
const int L = 1 << 17;
int n, sol;
int l[MAXN], v[MAXN], t[MAXN], path[MAXN];

int find(int val) {
    int step = L;
    int p = 0;
    while (step != 0) {
        if (p + step <= n && l[p + step] < val) {
            p += step;
        }
        step /= 2;
    }
    return p;
}

int main()
{
    in >> n;
    for (int i = 1; i <= n; ++i) {
        in >> v[i];
        l[i] = INF;
    }

    for (int i = 1; i <= n; ++i) {
        int best = find(v[i]);
        best++;
        t[i] =  best;

        if (l[best] > v[i]) l[best] = v[i];
        sol = max(sol, best);
    }

    out << sol << "\n";

    int c = sol;
    int nr = INF;
    for (int i = n; i >= 1; --i) {
        if (t[i] == c && v[i] < nr) {
            path[++path[0]] = v[i];
            nr =  v[i];
            c--;
        }
    }

    for (int i = sol; i >= 1; --i) out << path[i] << " ";

    return 0;
}