#include <iostream>
#include <cstdio>
#define MAXN 100050

using namespace std;

int a[MAXN], din[MAXN], from[MAXN], sol[MAXN], nq, n, best;

int caut(int nr)
{
    int step, val = 0;
    for (step = 1; step < best; step <<= 1);
    for (step; step; step >>= 1)
		if (val+step <= best && nr > a[din[val+step]])
			val += step;
	return val;
}

void solve()
{
    din[best=1] = 1;
    for (int i = 2; i <= n; i++) {
        int pos = caut(a[i]);
		if (pos == best || a[i] < a[din[pos+1]]) {
			din[pos+1] = i;
			from[i] = din[pos];
		}
		if (pos == best)
			best++;
    }
}

void traseu()
{
    for (int ind = din[best]; ind; ) {
		sol[++nq] = a[ind];
		ind = from[ind];
    }
    for (int i = nq; i >= 1; i--)
		printf("%d ", sol[i]);
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	solve();
	printf("%d\n", best);
	traseu();

    return 0;
}