#include <fstream.h>
#define N 100001
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long a[N], n, p[N], L[N];
void scmax(){

	int i,j;
	
	for (i=n; i>0; i--){
		
		L[i] = 1; // lungimea sirului maximal i 
		p[i] = i; // urmatorul element dupa i
		
		for (j=i+1; j<=n; j++)
			if(a[i] < a[j] && L[i] <= L[j]){
				L[i] = L[j] + 1;
				p[i] = j;
			}
	}
	
}

int find_sol(){
	int max = -1, k;
	
	for (int i=1;i<=n;i++)
		if (L[i] >= max){max = L[i]; k = i;}
		
	return k;	
}


int main(){
	long i,j,k;
	
	fin>>n;
	for (i=1;i<=n; i++)
		fin>>a[i];
	
	scmax();
	k = find_sol();
	
	fout<<L[k]<<"\n";
	
	for (i=1,j=k;i<=L[k];i++,j=p[j])
		fout<<a[j]<<" ";	
	
	return 0;
}