#include <bits/stdc++.h>

using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n, a[100005], d[100005], last[100005], k, bestp;

int cauta(int x) {
    int l = 0, r = k;
    int ans = 0;

    while (l <= r) {
        int m = (l + r) / 2;
        if (a[d[m]] < x) {
            ans = max(ans, m);
            l = m + 1;
        } else {
            r = m - 1;
        }
    }

    return ans;
}

void afisare(int p) {
    if (p == 0)
        return;
    afisare(last[p]);
    out << a[p] << " ";
}

int main()
{
    in >> n;
    for (int i = 1; i <= n; i++)
        in >> a[i];

    for (int i = 1; i <= n; i++) {
        int pos = cauta(a[i]);
        last[i] = d[pos];
        d[pos + 1] = i;

        if (pos + 1 > k) {
            k = pos + 1;
            bestp = i;
        }
    }

    out << k << '\n';
    afisare(bestp);

    return 0;
}