#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define value first
#define initialPos second
#define nmax 100005
using namespace std;

vector <pair <int, int> > v;
vector <int> sol;

int H[3*nmax], best[nmax], w[nmax];
int n, x, bestestBest;

int query(int node, int lo, int hi, int a, int b) {
    if(b < a) return 0;
    if(a <= lo && hi <= b) return H[node];

    int mid = (lo + hi) >> 1;

    int opt1 = 0, opt2 = 0;
    if(a <= mid) opt1 = query(2*node, lo, mid, a, b);
    if(b > mid)  opt2 = query(2*node+1, mid+1, hi, a, b);

    return max(opt1, opt2);
}

void update(int node, int lo, int hi, int pos, int val) {
    if(lo == hi) {
        H[node] = val;
        return;
    }

    int mid = (lo + hi) >> 1;
    if(pos <= mid) update(2*node, lo, mid, pos, val);
    else           update(2*node+1, mid+1, hi, pos, val);

    H[node] = max(H[2*node], H[2*node+1]);
}

int main() {
    ifstream f("scmax.in");
    ofstream g("scmax.out");

    f>>n;
    for(int i=1; i<=n; i++) {
        f>>w[i];
        v.push_back(make_pair(w[i], i));
    }

    sort(v.begin(), v.end());
    for(int i=0; i<v.size(); i++) {

        if(i > 0 && v[i].value == v[i-1].value)                 //daca am 2 valori egale, consecutive
            update(1, 1, n, v[i-1].initialPos, 1);              //atunci elimin bestul primului, ca sa nu poata fi continuat prin al doilea


        bestestBest = query(1, 1, n, 1, v[i].initialPos-1);     //caut bestul maxim din [1, v[i].initialPos-1]
        best[v[i].initialPos] = bestestBest + 1;

        update(1, 1, n, v[i].initialPos, best[v[i].initialPos]);

    }


    bestestBest = 1;
    for(int i=1; i<=n; i++) bestestBest = max(bestestBest, best[i]);

    for(int i=n; i>=1; i--) {
        if(best[i] == bestestBest) {
            sol.push_back(w[i]);
            bestestBest--;
        }
    }

    g<<sol.size()<<"\n";
    for(int i=sol.size()-1; i>=0; i--) g<<sol[i]<<" ";


    return 0;
}