#include <bits/stdc++.h>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

const int NMAX = 1e5;

int n;
int v[NMAX + 1];
int dp[NMAX + 1]; // dp[i] =def= lungimea celui mai lung subsir crecator care se termina cu elementul v[i]
vector<int> ans;

int main() {
	fin >> n;

	for(int i = 1; i <= n; i++) {
		fin >> v[i];
	}

	dp[1] = 1;

	for(int i = 2; i <= n; i++) {
		for(int j = 1; j < i; j++) {
			if(v[j] < v[i]) {
				dp[i] = max(dp[i], dp[j]);
			}
		}
		dp[i]++;
	}

	int pos = 1;

	for(int i = 2; i <= n; i++) {
		if(dp[pos] < dp[i]) {
			pos = i;
		}
	}

	fout << dp[pos] << '\n';

	while(dp[pos] >= 1) {
		ans.push_back(pos);
		// cautam dp[prev] = dp[pos] - 1, iar 1 <= prev < pos && v[prev] < v[pos]
		int prev = pos - 1;
		while(prev >= 1 && (dp[prev] == dp[pos] - 1 && v[prev] < v[pos]) == 0) {
			prev--;
		}
		pos = prev;
	}

	reverse(ans.begin(), ans.end());

	for(int i = 0; i < (int) ans.size(); i++) {
		fout << v[ans[i]] << " ";
	}
	return 0;
}