#include <iostream>
#include <fstream>
#include <algorithm>
#define nmax 100005
#define val first
#define ind second
using namespace std;

int H[4*nmax], dp[nmax], x, n, sol, last;
pair <int, int> v[nmax];

bool cmp(pair <int, int> a, pair <int, int> b) {
	if(a.val == b.val) return(a.ind > b.ind);
	return (a.val < b.val);
}

void update(int node, int lo, int hi, int pos, int val) {
	if(lo == hi) {
		H[node] = val;
		return;
	}

	int mid = (lo+hi)>>1;
	if(pos <= mid) update(2*node, lo, mid, pos, val);
	else update(2*node+1, mid+1, hi, pos, val);

	H[node] = max(H[2*node], H[2*node+1]);
}

void query(int node, int lo, int hi, int a, int b) {
	if(a <= lo && hi <= b) {
		sol = max(sol, H[node]);
		return;
	}

	int mid = (lo+hi)>>1;
	if(a <= mid) query(2*node, lo, mid, a, b);
	if(mid < b)  query(2*node+1, mid+1, hi, a, b);
}

int main() {
	ifstream f("scmax.in");
	ofstream g("scmax.out");

	f>>n;
	for(int i=1; i<=n; i++) {
		f>>x;
		v[i] = make_pair(x, i);
	}

	sort(v+1, v+n+1, cmp);
	for(int i=n; i>=1; i--) {
		sol = 0;
		query(1, 1, n, v[i].ind + 1, n);
		dp[v[i].ind] = sol + 1;

		update(1, 1, n, v[i].ind, sol + 1);
	}
	sol = 1;
	for(int i=1; i<=n; i++) if(dp[i] > dp[sol]) sol = i;

	g<<dp[sol]<<"\n";
	for(int i=sol, j; i<=n; ) {
		j = i + 1;
		g<<v[i].val<<" ";

		while(j <= n && (v[j] <= v[i] || dp[i] - 1 != dp[j])) j++;
		i = j;
	}


	return 0;
}