#include<fstream>
#define NMAX 100010
#define INF 2000000100

using namespace std;

ifstream f("scmax.in");
ofstream g("scmax.out");

int a[NMAX], n, pzi[NMAX], lg[NMAX], best[NMAX], pzbest[NMAX], m=1;

void Citeste()
{
	int i;
	f>>n;
	for (i=1; i<=n; ++i) { f>>a[i]; best[i]=INF;}
}

int cauta(int x)
{
	int st=1, dr=m, j=m, mij, ok=0;
	while (st<=dr && !ok)
	{
		mij=(st+dr)>>1;
		if (best[mij]==x) ok=mij;
		else if (best[mij]<x) st=mij+1;
			else dr=mij-1, j=mij;
	}
	if (ok!=0) return -ok;
	else return j;
}

void Solve()
{
	int i, c;
	for (i=1; i<=n; ++i)
	{
		c=cauta(a[i]);
		if (c>0)
		{
			if (best[c]==INF) ++m, pzbest[m-1]=i, pzi[i]=pzbest[m-2];
			lg[i]=c;  best[c]=a[i], pzbest[c]=i;
		}
		else
			lg[i]=-c;
	}
	g<<m-1<<"\n"<<best[1];
	for (i=2; i<m; ++i) g<<" "<<best[i];
	g<<"\n";
}

int main()
{
	Citeste();
	Solve();
	f.close();
	g.close();
	return 0;
}