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

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

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

void SCM() {
    int index;
    for(int 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(0,len,v[i]);
            T[index] = i;
            R[T[index]] = T[index-1];
        }
    }
}

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

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