#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "scmax";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 100000 + 5;
const int INF = (1LL << 31) - 1;

int N, sol;
int T[NMAX];
int D[NMAX];
int V[NMAX];
int S[NMAX];

int main() {
    int i, j, k;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &N);

    for(i = 1; i <= N; i++)
        scanf("%d", &V[i]);

    for(i = 1; i <= N; i++) {
        T[i] = INF;
        j = lower_bound(T + 1, T + i + 1, V[i]) - T;
        D[i] = j;
        T[j] = V[i];
        sol = max(sol, D[i]);
    }

    printf("%d\n", sol);

    for(i = sol, j = N, k = INF; i >= 1 && j >= 1; j--)
        if(D[j] == i && V[j] < k) {
            k = V[j];
            S[i] = k;
            i--;
        }

    for(i = 1; i <= sol; i++)
        printf("%d ", S[i]);

    return 0;
}