#include <stdio.h>
#include <algorithm> 
#include <cstring> 
using namespace std;
 
#define MAXN 100001

int N, values[MAXN], V[MAXN]; 
int O[MAXN], B[MAXN], AIB[MAXN];
int best, P[MAXN];
 
void update(int x, int ind){	
	for (; x <= N; x += x^(x-1) & x)
		if (B[ind] > B[AIB[x]])
			AIB[x] = ind;
}
 
int query(int x){
	int mx = 0;
	for (; x; x -= x^(x-1) & x)
		if (B[AIB[x]] > B[mx])
			mx = AIB[x];
	return mx;
}
 
int main(void){
	int i, h = 1;
 
	//freopen("scmax.in", "r", stdin);
	freopen("scmax_test9.in", "r", stdin);
	freopen("scmax.out", "w", stdout);
 
	scanf("%d", &N);
	for (int i = 1; i <= N; i++){
		scanf("%d", &V[i]);
		//values[i] = O[i] = V[i];
	}
	memcpy(values,V,(N+1)*sizeof(int));
	memcpy(O,V,(N+1)*sizeof(int));
	
	// sortarea vectorului
	sort(O+1, O+N+1);
	
	for (i = 2; i <= N; ++i){
		if (O[i] != O[h])
			O[++h] = O[i];
	}

	for (i = 1; i <= N; ++i)
		V[i] = lower_bound(O+1, O+h+1, V[i]) - O;
	
	for (i = 1; i <= N; i++){
		P[i] = query(V[i]-1);
		B[i] = B[P[i]] + 1;
		update(V[i], i);
	}
	
	for (i = 1; i <= N; ++i){
		if (B[best] < B[i])
			best = i;
	}
	
	printf("%d\n", B[best]);

	if(B[best]==1){
		printf("%d\n",values[best]);
		return 0;
	}

	for (h = 0, i = best; i; i = P[i])
		O[++h] = values[i];
 
	for (i = h; i; --i)
		printf("%d ", O[i]);
	printf("\n");

	return 0;
}