#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");

vector<long> a,k,x;
vector<long>::iterator it;
long n,i,q,maxim;

int main()
{
in>>n;
for(i=0; i<n; i++)
	{
	in>>q;
	x.push_back(q);
	it = lower_bound(k.begin(),k.end(),q);
	if(it == k.end())
		{
		k.push_back(q);
		a.push_back(k.size());
		}
	else if(*it == q)
		{
		a.push_back(it - k.begin());
		}
	else
		{
		*it = q;
		a.push_back(it - k.begin() + 1);
		}
	if(a.back() > a[maxim])
		maxim = i;
	}
out<<a[maxim]<<'\n';
k.clear(); k.push_back(maxim);

for(i=maxim-1; i>=0; i--)
	{
	if(a[i] == a[maxim]-1 && x[maxim] > x[i])
		{
		k.push_back(i);
		maxim=i;
		}
	if(a[maxim] == 1)
		break;
	}

for(i=k.size()-1; i>=0; i--)
	out<<x[k[i]]<<' ';
}