#include <iostream>
#include <fstream>
#include <algorithm>
#include <stack>
#include <limits.h>

using namespace std;

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

int v[100003];
int t[100003];
int f[100003];
int k;
int n;

void afis(int i) {
    if(f[i] != 0)
        afis(f[i]);
    out << v[i] << " ";
}

int main() {
    in >> n;
    int mx = 0;
    for(int i = 0; i < n; i++) {
        in >> v[i];
        f[i] = lower_bound(t, t+k, v[i])-t;
        if(f[i] >= k) {
            mx = i;
            k++;
        }
        t[f[i]] = v[i];
    }
    out << f[mx]+1 << '\n';
    afis(mx);
    return 0;
}