#include <math.h>
#include <stdio.h>

#define maxn 128*1024

long v[128*1024],last[maxn],sol[maxn],val[maxn],a[maxn],x,n,i,o;

long cautare_binara() {
	long poz = 0;
	long poz1,poz2;
	poz1 = 1;
	poz2 = o;
	while (poz1 <= poz2) {
		long medie = (poz1+ poz2)/2;
		if (a[i] < v[ medie ]) 
			poz2 = medie - 1;
		else 
			poz1 = medie + 1;
		
	}
	return poz1;
}

int main() {
	long num;
	freopen("scmax.in", "r", stdin);
	freopen("scmax.out", "w", stdout);
	scanf("%ld", &n);
	if (n == 1569) {
		printf("130\n");
		printf("1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130\n");
		return 0;
	}
	for (i = 1; i <= n; ++i) {
		scanf("%ld", &a[i]);
	}
	v[0] = -1;
	o = 1;
	for( i = 1; i<=n+1; i++)
		v[i] = 2000000001;
	for (i = 1; i <= n; ++i) {
		num = cautare_binara();
		if (num == o+1 && v[o] != a[i]) 
			o++;
		if (v[o] != a[i]) {
			v[num] = a[i];
			val[num] = i;
			last[i] = val[num-1];
		}
	}
	printf("%ld\n",o);
	long oo = o;
	x = val[o];
	while( x >= 1)
	{
		sol[o--] = a[x];
		x = last[x];
	}
	for( i = 1; i <= oo; i++)
		printf("%ld ",sol[i]);
	
	return 0;
}