#include<bits/stdc++.h>
#define IN_FILE fin("scmax.in");
#define OUT_FILE fout("scmax.out");
#include<vector>
#include<queue>
 
using namespace std;
 
ifstream IN_FILE
ofstream OUT_FILE

int P[100001];

int main()
{
    int k,i,A[100001],n;
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>A[i];
    k=1;
    int D[100001];
    D[k] = A[1];
    for(i=2;i<=n;i++)
    {
        if(A[i] > D[k])
        {
            P[++k] = A[i];
        }
        else{
            int st = 1,dr = k, poz = k+1;
            while(st<=dr)
            {
                int m = (st+dr)/2;
                if(D[m]>A[i])
                {
                    poz=m;
                    dr = m-1;
                }
                else{
                    st = m+1;
                }
            }
            D[poz] = A[i];
        }
    }
    fout<<k-1<<'\n';
    int I[100001];
    k=1;
    D[k]=A[1];
    P[1] = 1;
    for(int i = 2 ; i <= n ; i ++)
	if(A[i] > D[k])
		D[++k] = A[i], P[i] = k;
	else
	{
		int st = 1 , dr = k , p = k + 1;
		while(st <= dr)
		{
			int m = (st + dr) / 2;
			if(D[m] > A[i])
				p = m, dr = m - 1;
			else
				st = m + 1;
		}
		D[p] = A[i];
		P[i] = p;
	}
    int j = n;
    for(int i = k ; i >= 1 ; i --)
    {
        while(P[j] != i)
            j --;
        I[i] = j;
    }
    for(i=1;i<=k;i++)
        fout<<A[I[i]]<<" ";
    return 0;
}