#include "pch.h"
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

int n;
int ans[100005];
int v[100005];
int curMaxLen[100005];
int dp[100005];

int binSearch(int val, int pos) 
{
	int left = 1;
	int right = pos;
	int last = 0;

	while (left <= right) {
		int mid = left + (right - left) / 2;

		if (dp[mid] < val) {
			left = mid + 1;
			last = mid;
		}
		else {
			right = mid-1;
		}
	}

	return last;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];
		dp[i] = 2e9 + 5;
	}

	int scm = 0;

	for (int i = 1; i <= n; ++i) {
		int curLen = binSearch(v[i], scm);
		dp[curLen + 1] = min(v[i], dp[curLen+1]);
		scm = max(scm, curLen + 1);
		curMaxLen[i] = curLen + 1;
	}

	int pos = scm;
	int k = 0;
	for (int i = n; i >= 1; --i) {
		//if (!pos) break;

		if (curMaxLen[i] == pos) {
			pos--;
			ans[++k] = v[i];
		}
	}

	cout << k << '\n';

	for (int i = k; i >= 1; --i) {
		cout << ans[i] << " ";
	}
}