#include <cstdio>
#include <fstream>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;

int N;

int v[100010];
int d[100010];

map<int, int> mp;

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

int main() {

	in >> N;

	for (int i = 1; i <= N; ++i)
	{
		in >> v[i];
	}
	int l_max = 1;
	for (int i = 1; i <= N; ++i)
	{
		auto e = mp.lower_bound(v[i]);

		if (e == mp.begin())
		{
			d[i] = 1;
		}
		else
		{
			--e;
			d[i] = (*e).second + 1;

			l_max = max(l_max, d[i]);
		}

		mp[v[i]] = d[i];

		e = mp.find(v[i]);
		++e;
		for (; e != mp.end();)
		{
			if ((*e).second <= d[i])
			{
				e = mp.erase(e);
			}
			else
			{
				break;
			}
		}
	}


	vector<int> rez;
	for(int i=1;i<=N;++i)
	{
		if(d[i] == l_max)
		{
			rez.push_back(v[i]);
			l_max--;
			for(int j=i-1;j>=1;--j)
			{
				if(v[j] < rez.back() && d[j] == l_max)
				{
					rez.push_back(v[j]);
					l_max--;
				}
			}
			break;
		}
	}

	out <<rez.size()<<"\n";

	for(int i=rez.size() -1; i>=0;--i)
	{
		out <<rez[i]<<" ";
	}
	return 0;
}