#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 = 1;
int l[MAXN], v[MAXN], t[MAXN];

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

void write(int pos) {
    if (pos == 0) return;
    write(t[pos]);
    out << v[pos] << " ";
}

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

    l[1] = 1;

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

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

    out << sol << "\n";

    write(l[sol]);

    return 0;
}