#include <bits/stdc++.h>
using namespace std;

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

int n, v[100001], i, j, dp[100001], maxim;
vector < int > drum;

int main()
{
    in >> n;
    for(i = 1; i <= n; ++i) {
        in >> v[i];
        dp[i] = 1; }
    maxim = 1;
    for(i = 1; i <= n; ++i)
        for(j = 1; j < i; ++j) {
            if(v[j] < v[i] && dp[j] + 1 > dp[i]) {
                dp[i] = dp[j] + 1;
                maxim = max(maxim, dp[i]);
            }
    }

    out << maxim << '\n';
    for(i = n; i >= 1; --i) {
        if(!maxim) break;
        if(dp[i] == maxim) {
            drum.push_back(v[i]);
            maxim--;
        }
    }

    reverse(drum.begin(), drum.end());
    for(auto x : drum) out << x << ' ';
    return 0;
}