#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a,l,init;
vector <int> ::iterator it;
vector <int> ::reverse_iterator rIt;
int n,x,i,j;
int main()
{
	freopen("scmax.in","r",stdin);
	freopen("scmax.out","w",stdout);
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);
		init.push_back(x);
		it=lower_bound(a.begin(),a.end(),x);
		if(it!=a.end())
		{
			*it=x;
			l.push_back(it-a.begin()+1);
		}
		else
		{
			a.push_back(x);
			l.push_back(a.size());
		}
	}
	printf("%d\n",a.size());a.resize(0);
	it=max_element(l.begin(),l.end());
	i=it-l.begin();j=i;a.push_back(init[i]);
	for(--i;i>=0;i--)
		if(l[i]+1==l[j]&&init[i]<init[j])
		{
			a.push_back(init[i]);
			j=i;
		}
	for(rIt=a.rbegin();rIt!=a.rend();rIt++)
		printf("%d ",*rIt);
	printf("\n");
	return 0;
}