#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "scmax"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 100001
#define INF 0xffffff

int n,a[MAX],b[MAX],c[MAX],k;

int BSearch(int val,int l,int r)
{
	int m;
	while(l<r)
	{
		m=(l+r)/2;
		if(c[m]<val)l=m+1; else r=m;
	}
	return l;
}

void Tipar(int n,int k)
{
	for(int i=n;i>0;i--)
		if(b[i]==k)
		{
			Tipar(i-1,k-1);
			printf("%d ",a[i]);
			return;
		}
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);	
	// start
	int p;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		for(int i=1;i<=n;i++)
		{
			p=BSearch(a[i],1,k+1);
			c[p]=a[i];
			b[i]=p;
			if(p>k)k=p;
		}
		//for(int i=1;i<=n;i++)printf("%d ",b[i]);
		printf("%d\n",k);
		Tipar(n,k);
	return 0;
}