#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

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

const int MAX_N = 100100;

int size;
int v[MAX_N];
int d[MAX_N];
int from[MAX_N];

int search(int st, int dr, int x) {
    int ans = 0;
    while(st <= dr) {
        int mij = (st+dr)/2;
        if(v[d[mij]] < x) {
            ans = mij;
            st = mij + 1;
        }
        else {
            dr = mij -1;
        }
    }
    return ans;
}

int main() {
    int n;
    fin >> n;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    
    d[++size] = 1;
    for(int i = 2; i <= n; i++) {
        if(v[i] > v[d[size]]) {
            d[++size] = i;
            from[i] = d[size - 1];
        }
        else {
            int poz = search(0, size, v[i]);
            from[i] = d[poz];
            if(v[i] < v[d[poz+1]]) {
                d[poz+1] = i;
            }
        }
    }
    fout << size << '\n';
    vector<int> sol;
    for(int i = d[size]; i; i = from[i]) {
        sol.push_back(v[i]);
    }
    reverse(sol.begin(), sol.end());
    for(auto it : sol) {
        fout << it << ' ';
    }
    return 0;
}