#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int v[100001], d[100000], ind[100001], sol[100001];
int n, k = 1;
int main() {
	in >> n;
	for (int i = 0; i < n; i++) in >> v[i + 1];
	d[1] = v[1];
	for (int i = 2; i <= n; i++) {
		if (v[i] > d[k]) d[++k] = v[i], ind[i] = k;
		else {
			int p = lower_bound(d + 1, d + k + 1, v[i]) - d;
			ind[i] = p;
			d[p] = v[i];
		}
	}
	out << k << '\n';
	int j = n;
	for (int i = k; i >= 1; i--) {
		while (ind[j] != i) j--;
		sol[i] = j;
	}
	for (int i = 1; i <= k; i++) out << v[sol[i]] << " ";
	return 0;
}