#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define maxN 100005
#define INF (1LL << 31)-1

int Ans[maxN];
int V[maxN];
int Q[maxN];
int P[maxN];

inline int max(int a,int b){
    return a>b?a:b;
}

int main(){

    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

    int n;
    scanf("%d",&n);
    for(int i = 1; i <= n; i++){
        scanf("%d", &V[i]);
    }

    int Best = 0;
    for(int i = 1; i <= n; i++){
        Q[i] = INF;
        int p = lower_bound(Q+1, Q+i+1, V[i]) - Q;
        Q[p] = V[i];
        P[i] = p;
        Best = max(Best , p);
    }

    for(int i = n, j = Best; i && j ; i--){
        if(P[i] == j){
            Ans[j] = V[i];
            j--;
        }
    }

    printf("%d\n",Best);
    for(int i = 1; i <= Best; i++){
        printf("%d ",Ans[i]);
    }
}