#include<cstdio>
#define MAX_N 100000
using namespace std;

int v[MAX_N], T[MAX_N], R[MAX_N], n, len;
FILE *fout = fopen("scmax.out","w");

int binarySearch(int val, int End) {
    int left, right, mid, pos;
    left = 0;
    right = End;
    pos = -1;
    while(left <= right && pos == -1) {
        mid = (left + right) >> 1;
        if(v[T[mid]] <= val && val < v[T[mid+1]])
            pos = mid + 1;
        else if(val < v[T[mid]])
            right = mid - 1;
        else left = mid + 1;
    }
    return pos;
}

void longestIncreasingSubsequence() {
    int i, index;
    for(i=1; i<n; i++) {
        if(v[i] > v[T[len]]) {
            len++;
            T[len] = i;
            R[T[len]] = T[len-1];
        } else if(v[i] < v[T[0]])
            T[0] = i;
        else {
            index = binarySearch(v[i],i);
            T[index] = i;
            R[T[index]] = T[index-1];
        }
    }
}

void printSol(int x) {
    if(x != -1) {
        printSol(R[x]);
        fprintf(fout,"%d ",v[x]);
    }
}

int main() {
    FILE *fin = fopen("scmax.in","r");
    fscanf(fin,"%d",&n);
    for(int i=0; i<n; i++) {
        fscanf(fin,"%d",&v[i]);
        R[i] = -1;
    }
    longestIncreasingSubsequence();
    fprintf(fout,"%d\n",len+1);
    printSol(T[len]);
    fprintf(fout,"\n");
    fclose(fin);
    fclose(fout);
    return 0;
}