#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");

#define ll long long
#define pb push_back
const int NMax = 1e5 + 5;
const ll inf = 9e18 + 5;

int N;
int v[NMax],sol[NMax],pre[NMax];

void print(int);

int main() {
    in>>N;

    int nrSol = 0;
    for (int i=1;i <= N;++i) {
        in>>v[i];

        int idx = 0,pw;
        for (pw=1;pw <= nrSol;pw <<= 1) ;
        pw >>= 1;

        while (pw) {
            if (idx+pw <= nrSol && v[sol[idx+pw]] <= v[i]) {
                idx += pw;
            }

            pw >>= 1;
        }
        if (v[sol[idx]] == v[i]) {
            continue;
        }

        sol[idx+1] = i;
        pre[i] = sol[idx];
        if (idx == nrSol) {
            ++nrSol;
        }
    }

    out<<nrSol<<'\n';
    print(sol[nrSol]);

    in.close();out.close();
    return 0;
}

void print(int x) {
    if (x == 0) {
        return;
    }

    print(pre[x]);
    out<<v[x]<<' ';
}