#include <fstream>
#include <algorithm>
using namespace std;

const int MAX_N = 100002;

int N, Max, K;
int v[MAX_N], best[MAX_N], t[MAX_N], A[MAX_N], a[MAX_N], sol[MAX_N];

inline void Update(int pos, int ind) {
    for( ; pos <= N; pos += pos^(pos&(pos-1))) {
        if(best[ind] > best[A[pos]])
            A[pos] = ind;
    }
}

inline int Query(int pos) {
    int ind = 0;
    for( ; pos > 0; pos -= pos^(pos&(pos-1)))
        if(best[A[pos]] > best[ind])
            ind = A[pos];
    return ind;
}

inline int bs(int x) {
    int l = 1, r = K, m = 0;
    while(l <= r) {
        m = (l+r)/2;
        if(a[m] < x)
            l = m+1;
        else if(a[m] > x)
            r = m-1;
        else return m;
    }
    return 0;
}

int main() {
    ifstream f("scmax.in");
    ofstream g("scmax.out");

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

    sort(a+1, a+N+1);
    K = 1;
    for(int i = 2; i <= N; ++i)
        if(a[i] != a[K])
            a[++K] = a[i];

    for(int i = 1, x, p; i <= N; ++i) {
        x = bs(v[i]);
        p = Query(x-1);
        t[i] = p;
        best[i] = best[p] + 1;
        Update(x, i);
    }

    for(int i = 1; i <= N; ++i)
        if(best[i] > best[Max])
            Max = i;

    for(int i = Max, j = Max; i; i = t[i], --j)
        sol[j] = v[i];

    g << best[Max]<< "\n";
    for(int i = 1; i <= best[Max]; ++i)
        g << sol[i] << " ";
    g << "\n";

    f.close();
    g.close();

    return 0;
}