#include <cstdio>
#include <vector>
using namespace std;

const int N = 100001;

int n, nr;
int v[N], best[N], prev[N], L[N];

int bs ( int x ) {
	int p, u, m;
	p = 0; u = nr; m = (p+u)/2;
	while (p <= u) {
		if (v[L[m]] < x && v[L[m+1]] >= x)
			return m; else
		if (v[L[m+1]] < x) {
			p = m + 1;
			m = (p + u)/2;
		} else {
			u = m - 1;
			m = (p + u)/2;
		}
	}
	return nr;
}

int main() {
	freopen("scmax.in","rt",stdin);
	freopen("scmax.out","wt",stdout);
	scanf("%d",&n);
	for (int i = 1; i <= n; ++i) scanf("%d",&v[i]);
	L[0] = 0; best[1] = L[1] = 1; nr = 1;
	for (int i = 2; i <= n; ++i) {
		int poz = bs(v[i]);
		prev[i] = L[poz];
		best[i] = poz+1;
		L[poz+1] = i;
		if (nr < poz+1)
			nr = poz+1;
	}
	int max = 0, poz = 0;
	for (int i = 1; i <= n; ++i)
		if (max < best[i])
			max = best[i], poz = i;
	printf("%d\n",max);
	vector<int> sol;
	for (int i = poz; i != 0; i = prev[i]) sol.push_back(v[i]);
	for (int i = sol.size()-1; i >= 0; --i) printf("%d ",sol[i]);
	printf("\n");
	return 0;
}