#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];

priority_queue<pair<int, int>> q;

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;
        priority_queue<pair<int, int>> aux;
        bool lenFound = 0;
        while (q.empty() == 0) {
            if (nums[q.top().second] < nums[i]) {
                maxLenPos = i;
                pos[i] = q.top().second;
                maxSubsequenceLen[i] = q.top().first + 1;
                q.push({maxSubsequenceLen[i], i});
                if (maxSubsequenceLen[i] > answer) {
                    answer = maxSubsequenceLen[i];
                    startPos = i;
                }
                lenFound = 1;
                break;
            } else {
                aux.push(q.top());
                q.pop();
            }
        }
        while (aux.empty() == 0) {
            q.push(aux.top());
            aux.pop();
        }
        if (lenFound == 0) {
            q.push({maxSubsequenceLen[i] + 1, i});
            if (maxSubsequenceLen[i] > answer) {
                answer = maxSubsequenceLen[i];
                startPos = i;
            }
        }
    }
    fout << answer << '\n';
    output(startPos);
    return 0;
}