#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
#define LSB(a) ((-a) & a)
using namespace std;

#ifdef LOCAL
#define read() ifstream fin("date.in.txt");
#else
#define read() ifstream fin("scmax.in"); ofstream fout("scmax.out");
#endif // LOCAL

const int N = 100005;
int n, AIB[N];
int v[N];
int posAct[N];
vector<int> sol;
int idx[N], p[N];
int from[N];

int searchMax(int pos, int val) {
    int pMax = 0;
    while(pos > 0) {
        if(AIB[pMax] < AIB[pos] && v[posAct[pos]] < val)
            pMax = pos;

        pos -= LSB(pos);
    }
    return pMax;
}

void update(int pos, int val, int idxAct, int idxPrecedent) {
    while(pos <= n) {
        if(AIB[pos] <= val) {
            AIB[pos] = val;
            posAct[pos] = idxAct;
        }

        pos += LSB(pos);
    }
}

int main() {
    read();
    fin >> n;

    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        p[i] = i;
    }

    sort(p + 1, p + 1 + n, [&](int a, int b){return v[a] < v[b];});
    int level = 0;
    for (int i = 1; i <= n; ++i) {
        if(v[p[i - 1]] == v[p[i]])
            idx[p[i]] = level;
        else
            idx[p[i]] = ++level;
    }

    for (int i = 1; i <= n; ++i) {
        int posSecvMax = searchMax(idx[i], v[i]);
        from[i] = posAct[posSecvMax];
        update(idx[i], AIB[posSecvMax] + 1, i, posAct[posSecvMax]);
    }

    int act = searchMax(n, INT_MAX);
    #ifdef LOCAL
    cout << AIB[act] << '\n';
    act = posAct[act];
    while(act != 0) {
        sol.push_back(v[act]);
        act = from[act];
    }
    reverse(sol.begin(), sol.end());
    for (int x: sol) {
        cout << x << " ";
    }
    #else
    fout << AIB[act] << '\n';
    act = posAct[act];
    while(act != 0) {
        sol.push_back(v[act]);
        act = from[act];
    }
    reverse(sol.begin(), sol.end());
    for (int x: sol) {
        fout << x << " ";
    }
    #endif // LOCAL

    return 0;
}