#include<bits/stdc++.h>
using namespace std;
ifstream fin ("scmax.in"); ofstream fout ("scmax.out");
int n, array[100003], best[100003], p[100003], maxim, k, L[100003], nr;

void afis(int i)
{
	if (p[i] > 0) afis(p[i]);
	fout << array[i] << ' ';
}

int caut (int x)
{
	int p, u, m;
	p = 0; u = nr; m = (p + u)/2;
	while (p <= u)	
	{
		if (array[L[m]] < x && array[L[m + 1]] >= x) return m;
		else if (array[L[m + 1]] < x) {p = m + 1; m = (p + u) / 2;}
		else {u = m - 1; m = (p + u) / 2;}
	}
	return nr;
}

int main()
{
	int i,j,pos;
	nr = 1;
	fin >> n;
	for(i = 1; i <= n; i++)
		fin >> array[i];
	best[1] = L[1] = 1; L[0] = 0;

	for(i = 2; i <= n; i++)
	{
		pos = caut(array[i]);
		p[i] = L[pos];
		best[i] = pos + 1;
		L[pos + 1] = i;
		if (nr < pos + 1) nr = pos + 1;
	}
	maxim = 0;pos = 0;
	for(i = 1; i <= n; i++)
		if (maxim < best[i]) {maxim = best[i]; pos = i;}
	fout << maxim << '\n';
	afis(pos);
	return 0;
}