#include <bits/stdc++.h>

using namespace std;

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

const int MaxN = 100005;

int a[MaxN], c[MaxN], dp[MaxN], n, last[MaxN];
pair <int, int> b[MaxN];
pair <int, int> aint[4 * MaxN];


/**

(1, 8) => (1, 4) => (1, 2) => (1, 1)
                           => (2, 2)
                    (3, 4) => (3, 3)
                           =>

          (5, 8) => (5 6)
                    (7 8)


*/

void Update (int nod, int st, int dr, int poz, int val) {
    if (st == dr) {
        aint[nod] = {val, poz};
        return;
    }
    int mid = (st + dr) / 2;
    if (a[poz] <= mid)
        Update(2 * nod, st, mid, poz, val);
    else Update(2 * nod + 1, mid + 1, dr, poz, val);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}

pair <int, int> Query (int nod, int st, int dr, int x, int y) {

    if (x == st && y == dr) {
        return aint[nod];
    }
    int mid = (st + dr) / 2;
    if (y <= mid)
        return Query(2 * nod, st, mid, x, y);
    if (x > mid)
        return Query(2 * nod + 1, mid + 1, dr, x, y);
    pair <int, int> nr1 = Query(2 * nod, st, mid, x, mid);
    pair <int, int> nr2 = Query(2 * nod + 1, mid + 1, dr, mid + 1, y);
    return max(nr1, nr2);
}

void Afis(int nr) {
    if (nr != 0) {
        Afis(last[nr]);
        fout << c[nr] << " ";
    }
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> a[i], b[i] = {a[i], i}, c[i] = a[i];
    sort(b + 1, b + n + 1);
    int val = 1;

    a[b[1].second] = 1;
    for (int i = 2; i <= n; i++) {
        if (b[i].first != b[i - 1].first)
            val++;
        a[b[i].second] = val;
    }
    int ans = 1, poz_max = 1;
    for (int i = 1; i <= n; i++) {
        dp[i] = 1;
        if (a[i] > 1) {
            pair <int, int> val = Query(1, 1, n, 1, a[i] - 1);
            last[i] = val.second;
            dp[i] = 1 + val.first;
        }
        Update(1, 1, n, i, dp[i]);
        if (ans < dp[i]) {
            ans = dp[i];
            poz_max = i;

        }
    }
    fout << ans << "\n";
    Afis(poz_max);
    return 0;
}