#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, a[100001], c[100001], sol, pozz, poz[100001], dp[100001], h[300006], maxi, imax, k;
struct sir{
    int val, poz;
} b[100001];
bool mycmp(sir a, sir b) {
    return a.val <= b.val;
}
void update(int n, int l, int r, int p, int v) {
    if (l >= r) {h[n] = v; return;}
    int m = (l + r) >> 1;
    if (p <= m) update(n<<1, l, m, p, v);
    else update((n<<1)|1, m + 1, r, p, v);
    if (dp[h[n<<1]] > dp[h[(n<<1)|1]]) h[n] = h[n<<1];
    else h[n] = h[(n<<1)|1];
}
void query(int n, int l, int r, int a, int b) {
    if (a <= l && r <= b) {
        if (dp[h[n]] > sol) {
            sol = dp[h[n]];
            pozz = h[n];
        }
        return;
    }
    int m = (l + r) >> 1;
    if (a <= m) query(n<<1, l, m, a, b);
    if (b > m) query((n<<1)|1, m + 1, r, a, b);
}
int main()
{
    f >> n;
    for (int i = 1; i <= n; ++i) f >> a[i], c[i] = a[i], b[i].val = a[i], b[i].poz = i;
    sort(b+1, b+n+1, mycmp);
    k = 0;
    for (int i = 1; i <= n; ++i) {
        if (b[i].val - b[i - 1].val) ++k;
        a[b[i].poz] = k + 1;
    }
    dp[0] = poz[0] = poz[1] = 0, dp[1] = 1;
    update(1, 1, k, a[1], 1);
    for (int i = 2; i <= n; ++i) {
        sol = 0, pozz = 0;
        query(1, 1, k, 1, a[i] - 1);
        dp[i] = sol + 1;
        poz[i] = pozz;
        update(1, 1, k, a[i], i);
        if (dp[i] > maxi) {
            maxi = dp[i];
            imax = i;
        }
    }
    g << maxi << '\n';
    k = 0;
    for (int i = imax; i; i = poz[i]) {
        h[++k] = c[i];
    }
    for (int i = k; i; --i) g << h[i] << ' ';
    g << '\n';
    return 0;
}