#include <bits/stdc++.h>
#define Intro ios::sync_with_stdio(0), cin.tie(0)
#define ll long long
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int const N = 1e5 + 5;
vector<int> father(N), ordered_elements = {0}, tree(N);
unordered_map<int, int> pos;
unordered_set<int> unique_store;
int elements;

int query(int position) {
    int maximum = 0, max_pos = 0;
    while (position > 0) {
        if (maximum < tree[position]) {
            maximum = tree[position];
            max_pos = position;
        }
        position -= position & -position;
    }
    return max_pos;
}

int main() {
    fin >> elements;
    vector<int> unordered_elements(elements + 1);
    for (int i = 1; i <= elements; ++i) {
        fin >> unordered_elements[i];
        unique_store.insert(unordered_elements[i]);
    }
    int new_length = 1;
    for (int element : unique_store) {
        ordered_elements.push_back(element);
        new_length++;
    }
    sort(ordered_elements.begin(), ordered_elements.end());
    for (int i = 1; i < new_length; ++i) {
        pos[ordered_elements[i]] = i;
    }
    int last_pos = 0, maximum = 0;
    for (int i = 1; i <= elements; ++i) {
        int act_pos = pos[unordered_elements[i]];
        int act_max_pos = query(act_pos - 1);
        father[act_pos] = act_max_pos;
        tree[act_pos] = tree[act_max_pos] + 1;
        if (tree[act_pos] > maximum) {
            maximum = tree[act_pos];
            last_pos = act_pos;
        }
    }
    vector<int> scmax;
    fout << maximum << '\n';
    while (last_pos > 0 and maximum > 0) {
        scmax.push_back(ordered_elements[last_pos]);
        last_pos = father[last_pos];
        maximum--;
    }
    reverse(scmax.begin(), scmax.end());
    for (int element : scmax) {
        fout << element << ' ';
    }
    return 0;
}