//o(n log n) cu ideea lui francu
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define nmax 100005
using namespace std;

int n, m;
vector <int> q;
int v[nmax], h[nmax];

void insert(int i) {
	int val = v[i];
	int lo = -1;
	int hi = q.size();
	int mid;

	if(q.empty() || val >= q[q.size()-1]) {
		q.push_back(val);
		h[i] = q.size();
		return;
	}

	while(hi - lo > 1) {
		mid = lo + (hi - lo) / 2;
		if(val < v[mid]) hi = mid;
		else lo = mid;
	}
	//while(val >= q[lo]) lo++;
	q[lo] = val;
	h[i] = lo + 1;

}
		

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

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

		//for(int j=0; j<q.size(); j++) cout<<q[j]<<" "; cout<<"\n";
	}

	int dim = q.size();
	g<<dim<<"\n";
	cout<<dim<<"\n";

	int p = 1;
	for(int i=1; i<=n; i++) {
		if(p > dim) break;
		if(h[i] == p) {
			g<<v[i]<<" ";
			p++;
		}
		//cout<<h[i]<<" ";
	}

	return 0;
}