#include <iostream>
#include <fstream>
#include <string>
#include <cstring>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <deque>
#include <vector>
#include <set>
#include <queue>
#include <bitset>
#include <limits.h>
using namespace std;

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

const int MAX_SIZE = 100000;
int v[MAX_SIZE + 1];
pair<int, int> dp[MAX_SIZE + 1];

void displaySeq(int i) {
    vector<int> res;
    res.push_back(v[i]);
    while (dp[i].second != i) {
        i = dp[i].second;
        res.push_back(v[i]);
    }
    for (int i = res.size() - 1; i >= 0; --i) {
        fout << res[i] << " ";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        dp[i].first = 1;
        dp[i].second = i;
    }
    int maxLen = 1;
    int maxIndex = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = i - 1; j >= 0; --j) {
            if (v[j] < v[i] && dp[i].first < dp[j].first + 1) {
                dp[i].first = dp[j].first + 1;
                dp[i].second = j;
            }
        }
        if (maxLen < dp[i].first) {
            maxLen = dp[i].first;
            maxIndex = i;
        }
    }
    fout << maxLen << "\n";
    displaySeq(maxIndex);
}

/*

in loc sa folosim un string, mai bine stocam pentru fiecare punct pozitia anterioara, iar apoi facem om functie recursiva pentru a le afisa.
 
 
 */