#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <cstring>
#include <string>
#include <ctime>
#include <cassert>
#include <utility>

using namespace std;

#define LIM 100005

int dp[LIM];

int main() {
	freopen("scmax.in", "r", stdin);
	freopen("scmax.out","w", stdout);

    int n, a[LIM];

    cin >> n;

    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    for(int i = 0; i < n; i++) {
        dp[i] = 1;
    }

    // dp[i] = "lungimea celui mai lung subsir care se termina in i"
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(a[j] > a[i])
                dp[j] = max(dp[j], dp[i] + 1);
        }
    }

    int mx = -1, pos = -1;
    // problema cere lg celui mai lung subsir (nu neaparat cel care se termina in n) -> caut maximul dintre toate cele n calculate
    for(int i = 0; i < n; i++) {
        if(mx < dp[i]) {
            mx = dp[i];
            pos = i;
        }
    }

    cout << mx << "\n";

    vector<int> val;
    for(int i = pos; i >= 0 && mx > 0; i--) {
        if(dp[i] == mx) {
            val.push_back(a[i]);
            mx--;
        }
    }

    reverse(val.begin(), val.end());
    int sz = val.size();
    for(int i = 0; i < sz - 1; i++) {
        cout << val[i] << " ";
    }
    cout << val[sz - 1] << "\n";
	return 0;
}