#include <fstream>

#define MAXN 100005

using namespace std;

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

int nn, v[MAXN], dp[MAXN], dad[MAXN], N;

inline int BinarySearch(int val) {
    int ii, step;

    for (step = 1; step  <= nn; step <<= 1);

    for (ii = 0; step; step >>= 1) {
        if (ii + step <= nn && v[dp[ii + step]] < val) {
            ii += step;
        }
    }

    return ii;
}

///dp[i] = nr de ordine al celui mai mic nr din sir care
///este ultimul dintr-un subsir crescator de lungime i

inline void Afis(int a) {
    if (a) {
        Afis(dad[a]);
        fout << v[a] << " ";
    }
}

inline void Read() {
    int poz;

    fin >> N;

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

        poz = BinarySearch(v[i]);
        nn = max(nn, poz + 1);
        dp[poz + 1] = i;
        dad[i] = dp[poz];
    }

    fout << nn << "\n";

    Afis(dp[nn]);
}

int main () {
    Read();

    fin.close(); fout.close(); return 0;
}