#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[100005];
int cautare(int v[], int st, int dr, int x)
{
    int mij;
    while(dr - st > 1){
        mij = st + (dr - st) / 2;
        if (v[mij] >= x){
            dr = mij;
        }else{
            st = mij;
        }
    }
    return dr;
}
void Scmax(int N, int v[])
{
    int tail[N];
    int len = 1;
    tail[0] = v[0];
    for (int i=1;i<N;i++){
        if (v[i] < tail[0]){
            tail[0] = v[i];
        }else if (v[i] > tail[len - 1]){
            tail[len ++] = v[i];
        }else{
            tail[cautare(tail, -1, len - 1, v[i])] = v[i];
        }
    }

    fout << len << '\n';
    for (int i=0;i<len;i++){
        fout << tail[i] << ' ';
    }

}
int main() {
    fin >> n;
    for (int i=0;i<n;i++){
        fin >> a[i];
    }

    Scmax(n, a);
    return 0;
}