#include <bits/stdc++.h>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, i, j, a[100002], l[100002], m, r;
stack<int> s;

int main() {
    fin >> n;
    for(i = 1; i <= n; i++) {
        fin >> a[i];
        m = -1;
        for(j = 1; j < i; j++) {
            if(a[j] < a[i]) m = max(m, l[j]);
        }
        if(m == -1) l[i] = 1;
        else l[i] = m + 1;
        r = max(r, l[i]);
    }
    fout << r << "\n";
    i = n;
    while(r > 0) {
        while(l[i] != r) i--;
        s.push(a[i]);
        r--;
    }
    while(!s.empty()) {
        fout << s.top() << " ";
        s.pop();
    }

    return 0;
}