#include <fstream>
using namespace std;
int m[10000][10000];
int n;
int v[10000];
int sol[10000];
int k=0;

int getMaxSeq(int i,int j)
{

	if(j == 0 && v[i] > v[j])
		return 1;
	else if(j==0)
		return 0;
	if(m[i][j]>0)return m[i][j];

	
	int m1 = getMaxSeq(i,j-1);
	int m2 = -1;
	if(v[j] < v[i])
	{
		m2 = 1 + getMaxSeq(j,j-1);
	}
	m[i][j] = max(m1,m2);

	return m[i][j];
}
void getSol(int i,int j)
{

	if(j == 0 && v[i] > v[j])
	{
		sol[k++] = 0;
		return;
	}
	else if(j==0)
		return;
	
	if(v[j] < v[i] && (1 + m[j][j-1]) > m[i][j-1] )
	{
		sol[k++]=j;
		getSol(j,j-1);
	}
	else
		getSol(i,j-1);

}
int max (int a,int b)
{
	if(a>b)
		return a;
	return b;
}

int main()
{
	ifstream fin ("scmax.in");
	ofstream fout ("scmax.out");
	
	fin>>n;
	//v = new int[n+1];
	for(int i=0;i < n; i++)
		fin>>v[i];
	v[n] = v[n-1]+1;
	
	fout<< getMaxSeq(n,n-1) << endl;
	getSol(n,n-1);
	for(k = k-1; k>=0;k--)
		fout << v[sol[k]] << " ";

	fin.close();
	fout.close();
	return 0;
}