#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#define INF  10000000
#define nmax 100010
 
using namespace std;
 
 
int i,n,V[nmax],len,S[nmax], k;
int P[nmax],Q[nmax];
 
int main()
{
 	freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    scanf("%d", &n);
    scanf("%d", V + 1);
    Q[1] = V[1];len = 1;P[1] = 1;
    for (int i = 2; i <= n; ++i)
    {
        scanf("%d", V + i);
        Q[P[i] = upper_bound(Q + 1, Q + len + 1, V[i] - 1) - Q] = V[i];
        if(P[i] > len) len++;
    }
     
    for (int i = len,k = n; i; i--)
    {
        while(P[k] != i) k--;
            S[i] = V[k];
    }
    
    printf("%d\n", len);
    for (int i = 1; i <= len; ++i)
        printf("%d ", S[i]);
    return 0;
}