#include <bits/stdc++.h>

using namespace std;


/**Fie un vector a cu N elemente. Numim subsir al lui a de lungime K un vector a' = (ai1, ai2, ..., aiK) astfel incat sa avem i1 < i2 < ... < iK.

Cerinta
Sa se determine un subsir al lui a care este ordonat strict crescator si care are lungimea maxima. */

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

const int MaxN = 100005;
int a[MaxN], v[MaxN], dp[MaxN], n, last[MaxN];
pair <int, int > b[MaxN];
pair <int, int > aint[4*MaxN];

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(mid >= y)
        return Query(2 * nod, st, mid, x, y);
    if(mid + 1 <= x)
        return Query(2 * nod + 1, mid + 1, dr, x, y);
    return max(Query(2 * nod, st, mid, x, mid),
               Query(2 * nod + 1, mid + 1, dr, mid + 1, y));
}

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

int main()
{
    int poz = 1, ans = 1;
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> a[i], b[i] = { a[i], i };
        v[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;
    }
    for(int i = 1; i <= n; i++){
        dp[i] = 1;
        if(a[i] - 1 > 0){
            dp[i] = 1 + Query(1, 1, n, 1, a[i] - 1).first;
            last[i] = Query(1, 1, n, 1, a[i] - 1).second;
        }
        if(ans < dp[i]){
            ans = dp[i];
            poz = i;
        }
        Update(1, 1, n, i, dp[i]);
    }
    fout << ans << "\n";
    Afis(poz);
    return 0;
}