#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMAX = 100050;
int n, v[NMAX], poz[NMAX], a[NMAX], maxx, rez[NMAX];
int bin_search(int x)
{
        int st = 1, dr = maxx;
        while (st <= dr)
        {
                int mij = (st + dr) / 2;
                if (x > a[mij]) st = mij + 1;
                else dr = mij - 1;
        }
        return st;
}

int main()
{
	fin >> n;
	for (int i = 1; i <= n; ++i)
		fin >> v[i];
        for (int i = 1; i <= n; ++i)
        {
                int p = bin_search(v[i]);
                if (p > maxx) ++maxx;
                poz[i] = p, a[p] = v[i];
        }
        int k = maxx;
        for (int i = n; i >= 1; --i)
                if (poz[i] == k && (k == maxx || rez[k + 1] > v[i]))
                        rez[k--] = v[i];
        fout << maxx << "\n";
        for (int i = 1; i <= maxx; ++i)
                fout << rez[i] << " ";
        return 0;
}