#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
const int Vmax = 100001;
int a[Vmax];
int minVal[Vmax];
int pre[Vmax];
int lMax;

int main(){
    ifstream fin("scmax.in");
    ofstream fout("scmax.out");
    int n;
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    for(int i=1;i<=n;i++){
        if(minVal[lMax] < a[i]){
            lMax++;
            minVal[lMax] = a[i];
            pre[minVal[lMax]] = minVal[lMax];
        }
        else{
            int poz = upper_bound(minVal+1, minVal+lMax+1, a[i]) - minVal;
            minVal[poz] = a[i];
            if(minVal[poz] == minVal[poz-1]){
                pre[minVal[poz]] = pre[minVal[poz]];
                continue;
            }
            pre[minVal[poz]] = minVal[poz-1];
        }
    }
    fout<<lMax<<'\n';
    int sol[Vmax];
    int precedentul = minVal[lMax];
    for(int i=1;i<=lMax;i++){
        sol[i] = precedentul;
        precedentul = pre[precedentul];
    }
    for(int i=lMax;i>=1;i--)
        fout<<sol[i]<<" ";
    return 0;
}