#include <bits/stdc++.h>

using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
const int nMax = 100003;
int a[nMax], dp[nMax], k, rec[nMax], ans[nMax];
inline int Cb(int x) {
    int st = 1, dr = k, p;
    while(st <= dr) {
        int m = (st + dr) / 2;
        if(x > dp[m]) {
            st = m + 1;
        }
        else {
            p = m;
            dr = m - 1;
        }
    }
    return p;
}
int main()
{
    int n;
    f >> n;
    for(int i = 1; i <= n; i++) {
        f >> a[i];
    }
    dp[1] = a[1];
    rec[1] = 1;
    k = 1;
    for(int i = 2; i <= n; i++) {
        if(a[i] > dp[k]) {
            dp[++k] = a[i];
            rec[i] = k;
        }
        else {
            int poz = Cb(a[i]);
            dp[poz] = a[i];
            rec[i] = poz;
        }
    }
    g << k << "\n";
    int lg = k;
    for(int i = n; i >= 1; i--) {
        if(rec[i] == lg) {
            ans[lg] = a[i];
            lg--;
        }
    }
    for(int i = 1; i <= k; i++) {
        g << ans[i] << " ";
    }
    return 0;
}