#include <stdio.h>
#include <stdlib.h>

const int nmax = int(1e5) + 2;
int a[nmax];
int dp[nmax];
int who[nmax];
int bestP;
int n;

void readData() {
	scanf("%d",&n);
	for(int i = 0;i < n;i++) {
		scanf("%d",&a[i]);
	}
}

// O(n^2)
void solve() {
	dp[0] = 1;
	who[0] = -1;
	bestP = 0;
	for(int i = 1;i < n;i++) {
		dp[i] = 1;
		who[i] = -1;
		for(int j = 0;j < i;j++) {
			if(a[j] < a[i] && dp[j] + 1 > dp[i]) {
				dp[i] = dp[j] + 1;
				who[i] = j;
			}
		}

		if(dp[i] > dp[bestP]) bestP = i;
	}
}

void retrive(int pos) {
	if(who[pos] != -1) {
		retrive(who[pos]);
	}
	printf("%d ",a[pos]);
}

int main()
{
	freopen("scmax.in","r",stdin);
	freopen("scmax.out","w",stdout);
	readData();
	solve();
	printf("%d\n",dp[bestP]);
	retrive(bestP);
	return 0;
}