#include <fstream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#define zeros(x) (x & -x)
#define MAX 100005
using namespace std;

int n, aib[MAX], a[MAX], l[MAX], v[MAX], d[MAX], p[MAX];

void update(int pos, int val) {
    for(int i = pos; i <= n; i += zeros(i))
        if(d[aib[i]] < d[val])
            aib[i] = val;
}

int query(int pos) {
    int res = 0;
    for(int i = pos; i > 0; i -= zeros(i))
        if(d[res] < d[aib[i]])
            res = aib[i];
    return res;
}

int main() {
    ifstream f("scmax.in");
    ofstream g("scmax.out");
    f >> n;
    for(int i = 1; i <= n; ++i) {
        f >> a[i];
        l[i] = a[i];
    }
    sort(l + 1, l + n + 1);

    unordered_map<int, int> inds;
    inds[l[1]] = 1;
    int h = 1;
    for(int i = 2; i <= n; ++i)
        if(l[i] != l[h]) {
            l[++h] = l[i];
            inds[l[h]] = h;
        }

    for(int i = 1; i <= n; ++i)
        v[i] = inds[a[i]];

    for(int i = 1; i <= n; ++i) {
        p[i] = query(v[i] - 1);
        d[i] = d[p[i]] + 1;
        update(v[i], i);
    }

    int res = 0;
    for(int i = 1; i <= n; ++i)
        if(d[res] < d[i])
            res = i;
    g << d[res] << "\n";
    vector<int> vres;
    while(res) {
        vres.push_back(a[res]);
        res = p[res];
    }
    for(int i = vres.size() - 1; i >= 0; --i)
        g << vres[i] << " ";
    return 0;
}