#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> a;

bool cmp(int c, int b) {
	return a[c]<a[b] ?1 :0;
}

int main() {
	ifstream cin("scmax.in");
	ofstream cout("scmax.out");
	int n;
	cin >> n;
	a.resize(n);
	vector<int> minlast;
	vector<int>::iterator it;
	for (int i=0; i<n; ++i) cin >> a[i];
	for (int i=0; i<n; ++i) {
		it=lower_bound(minlast.begin(),minlast.end(),i,cmp);
		if (it==minlast.end()) minlast.push_back(i);
		else *it=i;
	}
	int last=minlast.back();
	minlast.clear();
	for (int i=0; i<=last; ++i) {
		it=lower_bound(minlast.begin(),minlast.end(),i,cmp);
		if (it==minlast.end()) minlast.push_back(i);
		else *it=i;
	}
	cout << minlast.size() << '\n';
	for (it=minlast.begin(); it!=minlast.end(); ++it)
		cout << a[*it] << ' ';
	return 0;
}