#include <fstream>
#include <bitset>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
typedef long long ll;
const ll NMAX = 100001;
ll n, m, ma, poz, aint[4 * NMAX], a[NMAX], d[NMAX], vals[NMAX];
vector<ll> b, storage;
void update(ll nod, ll l, ll r, ll poz, ll val) {
	if (l == r) {
		aint[nod] = val;
		return;
	}
	ll mj = (l + r) / 2;
	if (poz > mj)
		update(nod * 2 + 1, mj + 1, r, poz, val);
	else
		update(nod * 2, l, mj, poz, val);
	aint[nod] = max(aint[nod * 2], aint[nod * 2 + 1]);
}
ll query(ll nod, ll l, ll r, ll x, ll y) {
	if (l >= x && r <= y) {
		return aint[nod];
	}
	ll mj = (l + r) / 2;
	ll s1 = 0, s2 = 0;
	if (x <= mj)
		s1 = query(nod * 2, l, mj, x, y);
	if (y > mj)
		s2 = query(nod * 2 + 1, mj + 1, r, x, y);
	return max(s1, s2);///max(aint[nod], max(s1, s2));

}
int main()
{
	fin >> n;
	for (ll i = 1; i <= n; ++i) {
		fin >> a[i];
		vals[i] = a[i];
		b.push_back(a[i]);
	}
	sort(b.begin(), b.end());
	b.erase(unique(b.begin(), b.end()), b.end());
	for (ll i = 1; i <= n; ++i)
		a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin() + 1;
	for (ll i = 1; i <= n; ++i) {
		if (a[i] - 1 >= 1)
			ma = query(1, 1, n, 1, a[i] - 1);
		else ma = 0;
		d[i] = ma + 1;
		update(1, 1, n, a[i], d[i]);
	}
	for (ll i = 1; i <= n; ++i)
		if (ma < d[i]) {
			poz = i;
			ma = d[i];
		}
	fout << ma << "\n";
	storage.push_back(vals[poz]);
	ll x = d[poz];
	while (x != 1) {
		storage.push_back(vals[x]);
		x = d[x];
	}
	sort(storage.begin(), storage.end());
	for (ll i = 0; i < storage.size(); ++i)
		fout << storage[i] << " ";
}