#include <cstdio>
#include <vector>
using namespace std;
#define N 100001

int n, k;
vector<int> A[N];
vector<int> P[N];
vector<int> solutie;

FILE *f = fopen("scmax.in","r");
FILE *g = fopen("scmax.out","w");

int cb(int x)
{
    int r = 0, pas = 1<<20;
    while(pas)
    {
        if(r+pas <= k)
            if(A[r+pas][A[r+pas].size()-1] < x)
                r += pas;
        pas>>=1;
    }
    return r+1;
}

int main()
{
    int x;
    fscanf(f,"%d%d",&n,&x);
    A[++k].push_back(x);
    P[1].push_back(-1);
    for(int i=1; i<n; i++)
    {
        fscanf(f,"%d",&x);
        int y = cb(x);
        if(y > k) {
            k++;
            /// y == k
        }
        A[y].push_back(x);
        P[y].push_back(A[y-1].size() - 1);
    }
    fprintf(g,"%d\n",k);
    int p = A[k].size()-1;
    for(int i = k; i >= 1; i--) {
        solutie.push_back(A[i][p]);
        p = P[i][p];
    }
    for(int i=solutie.size()-1;i>=0;i--) {
        fprintf(g, "%d ", solutie[i]);
    }
    return 0;
}