#include <fstream>
#include <map>

using namespace std;

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

const int DIM = 100010;
int n, len;
int v[DIM], dp[DIM];
map<int, int> father;

int binarySearch(int val) {
    int left = 1, right = len;
    while (left <= right) {
        int middle = (left + right) / 2;
        if (dp[middle] < val)
            left = middle + 1;
        else
            right = middle - 1;
    }
    return left;
}

void getPath(int node) {
    if (father.find(node) != father.end()) {
        getPath(father[node]);
        fout << node << ' ';
    }
}

int main() {
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> v[i];

    for (int i = 1; i <= n; i++) {
        if (v[i] > dp[len]) {
            father[v[i]] = dp[len];
            dp[++len] = v[i];
        } else {
            int pos = binarySearch(v[i]);
            father[v[i]] = father[dp[pos]];
            dp[pos] = v[i];
        }
    }

    fout << len << '\n';
    getPath(dp[len]);

    return 0;
}