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

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

const int MAX_LENGTH = 100000;

int pos[MAX_LENGTH + 1];
int startPos;
int nums[MAX_LENGTH + 1];

void output(int currentPos) {
    if (pos[currentPos] == 0) {
        fout << nums[currentPos] << ' ';
        return;
    }
    output(pos[currentPos]);
    fout << nums[currentPos] << ' ';
}

int main() {
    int numLen;
    fin >> numLen;
    int maxSubsequenceLen[MAX_LENGTH + 1], answer = 0;
    maxSubsequenceLen[0] = 0;
    for (int i = 1; i <= numLen; ++i) {
        fin >> nums[i];
        int maxLen = 0, maxLenPos = 0;
        for (int j = 1; j < i; ++j) {
            if (maxSubsequenceLen[j] > maxLen && nums[j] < nums[i]) {
                maxLen = maxSubsequenceLen[j];
                maxLenPos = j;
                pos[i] = j;
            }
        }
        maxSubsequenceLen[i] = maxSubsequenceLen[maxLenPos] + 1;
        if (maxSubsequenceLen[i] > answer) {
            answer = maxSubsequenceLen[i];
            startPos = i;
        }
    }
    fout << answer << '\n';
    output(startPos);
    return 0;
}