#include <stdio.h>

int main()
{
	int i, N, P[300001];
	scanf("%d", &N);
	for (i = 1; i <= N; i++) scanf("%d", &(P[i]));
	
	int k = 0, l, r, m, dp[300001] = {}, sec[300001] = {}, prev[300001] = {}, lis[300001] = {}, num[300001] = {};
	for (i = 1; i <= N; i++) {
		l = 0;
		r = k;
		while (l < r) {
			m = (l + r + 1) / 2;
			if (P[dp[m]] > P[i]) r = m - 1;
			else l = m;
		}
		if (l == k) k++;
		else sec[i] = P[dp[l+1]];
		dp[l+1] = i;
		prev[i] = dp[l];
		num[l+1]++;
		lis[i] = l + 1;
	}
	
	int last[300001] = {}, ans = 0, flag[300001] = {}, cand[300001] = {};
	for (i = dp[k]; i > 0; i = prev[i]) flag[i] = 1;
	for (i = N, last[k] = N + 1; i >= 1; i--) {
		num[lis[i]]--;
		if (flag[i] != 0) {
			if (k == lis[i] && (num[lis[i]] == 0 || sec[i] > last[lis[i]]) && cand[lis[i]] >= 0) ans++;
			else flag[i] = 0;
		}
		if (P[i] < last[lis[i]]) {
			if (P[i] > last[lis[i]-1]) last[lis[i]-1] = P[i];
			if (cand[lis[i]-1] == 0) cand[lis[i]-1] = prev[i];
			else if (cand[lis[i]-1] != prev[i]) cand[lis[i]-1] = -1;
		}
		while (k > 0 && num[k] == 0) k--;
	}
	printf("%d\n", ans);
	for (i = 1; i <= N; i++) if (flag[i] != 0) printf("%d ", P[i]);
	printf("\n");
	fflush(stdout);
	return 0;
}