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

#include <iostream>
#include <fstream>
#include <stack>
#pragma warning(disable: 4996)
#define DIM 100006
using namespace std;

class InParser {
private:
	FILE* fin;
	char* buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int& n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		}
		else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long& n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		}
		else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
class OutParser {
private:
	FILE* fout;
	char* buff;
	int sp;

	void write_ch(char ch) {
		if (sp == 50000) {
			fwrite(buff, 1, 50000, fout);
			sp = 0;
			buff[sp++] = ch;
		}
		else {
			buff[sp++] = ch;
		}
	}


public:
	OutParser(const char* name) {
		fout = fopen(name, "w");
		buff = new char[50000]();
		sp = 0;
	}
	~OutParser() {
		fwrite(buff, 1, sp, fout);
		fclose(fout);
	}

	OutParser& operator << (int vu32) {
		if (vu32 <= 9) {
			write_ch(vu32 + '0');
		}
		else {
			(*this) << (vu32 / 10);
			write_ch(vu32 % 10 + '0');
		}
		return *this;
	}

	OutParser& operator << (long long vu64) {
		if (vu64 <= 9) {
			write_ch(vu64 + '0');
		}
		else {
			(*this) << (vu64 / 10);
			write_ch(vu64 % 10 + '0');
		}
		return *this;
	}

	OutParser& operator << (char ch) {
		write_ch(ch);
		return *this;
	}
	OutParser& operator << (const char* ch) {
		while (*ch) {
			write_ch(*ch);
			++ch;
		}
		return *this;
	}
};
InParser fin("scmax.in");
OutParser fout("scmax.out");

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;
}