#include "stdio.h"

#define MAX_N	100000

/* IO */
FILE *fin;
FILE *fout;

/* Problem Data */
int N;
int array[MAX_N];

int best[MAX_N];
int predecesor[MAX_N];
int max_index;

void read(void) {
	fin = fopen("scmax.in", "r");
	fscanf(fin, "%d", &N);

	int i;
	for (i = 0; i < N; i++) {
		fscanf(fin, "%d", &array[i]);
	}

	fclose(fin);
}

void write(void) {
	int subsequence[best[max_index]];
	int index = max_index, nr = 0, i;

	subsequence[nr++] = array[index];
	while (predecesor[index] >= 0) {
		subsequence[nr++] = array[predecesor[index]];
		index = predecesor[index];
	}

	fout = fopen("scmax.out", "w");
	fprintf(fout, "%d\n", best[max_index]);

	for (i = nr - 1; i >= 0; i--) {
		fprintf(fout, "%d ", subsequence[i]);
	}

	fclose(fout);
}

void solve(void) {
	int i, j, max_best, global_best = 0;

	best[0] = 1;
	predecesor[0] = -1;

	for (i = 1; i < N; i++) {
		predecesor[i] = -1;
		max_best = 0;
		for (j = i - 1; j >= 0; j--) {
			if (array[i] > array[j]) {
				if (best[j] > max_best) {
					max_best = best[j];
					predecesor[i] = j;
				}
			}
		}
		best[i] = 1 + max_best;
		if (best[i] > global_best) {
			global_best = best[i];
			max_index = i;
		}
	}
}

int main(void) {
	
	read();
	solve();
	write();

	return 0;
}