// Subsir crescator maximal.cpp : This file contains the 'main' function. Program execution begins and ends there.
// SCLM

#include <iostream>
#include <fstream>
#include <stack>
#define DIM 100006
std::ifstream fin("scmax.in");
std::ofstream fout("scmax.out");
using namespace std;

int N, A[DIM];
int k, dp[DIM];
int idx[DIM];
stack<int> subsir;

static inline void Read()
{
	fin >> N;
	for (int i = 1; i <= N; i++)
		fin >> A[i];
}

static inline void Solve()
{
	dp[(k = 0)] = 0;
	for (int i = 1; i <= N; i++)
	{
		if (dp[k] < A[i]) {
			dp[++k] = A[i];
			idx[i] = k;
		}
		else {
			// Cautare Binara pentru a afla pozitia minima pentru care dp[pozmin] >= A[i].
			int st = 1, dr = k, pozmin = 0;
			while (st <= dr)
			{
				int mij = (st + dr) / 2;
				if (dp[mij] >= A[i]) {
					pozmin = mij;
					dr = mij - 1;
				}
				else
					st = mij + 1;
			}
			dp[pozmin] = A[i];
			idx[i] = pozmin;
		}
	}
	fout << k << "\n";
}

static inline void Reconstruct()
{
	int poz = k;
	for (int i = N; i >= 1 && poz > 0; i--) {
		if (idx[i] == poz) {
			subsir.push(A[i]);
			poz--;
		}
	}
	while (!subsir.empty()) {
		fout << subsir.top() << " ";
		subsir.pop();
	}
}

int main()
{
	Read();
	Solve();
	Reconstruct();
	return 0;
}