#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

int n, elem, maxi = -1, pos_max;
vector<int> nrs, scmax, parent;
vector<pair<int, int>> nrso;

bool cmp(pair<int, int> p1, pair<int, int> p2){
	return (p1.first - p2.first) < 0;
}

int main(){
	freopen("scmax.in", "r", stdin);
	freopen("scmax.out", "w", stdout);
	scanf("%d", &n);

	for (int i = 0; i < n; i++){
		scanf("%d", &elem);
		nrs.push_back(elem);
		nrso.push_back(make_pair(elem, i));
		parent.push_back(-1);
		scmax.push_back(1);
	}

	sort(nrso.begin(), nrso.end(), cmp);	// o(nlogn)

	parent[nrso[0].second] = -1;
	for (int i = 1; i < n; i++){		//o(n)
		if (nrso[i].second > nrso[i - 1].second){
			parent[nrso[i].second] = nrso[i - 1].second;
		}
	}

	for (int i = 1; i < n; i++){	//o(n)
		if (parent[i] != -1){
			if (nrs[i] > nrs[parent[i]])
				scmax[i] = scmax[parent[i]] + 1;
			else
				scmax[i] = scmax[parent[i]];
			if (maxi < scmax[i]){
				maxi = scmax[i];
				pos_max = i;
			}
		}
	}
	printf("%d\n", maxi);
	int k = 0;
	// reuse scmax for answer
	while(pos_max != -1){
		if (k == 0 || (k - 1 >= 0 && nrs[pos_max] != scmax[k - 1]))
			scmax[k++] = nrs[pos_max];
		pos_max = parent[pos_max];
	}
	
	for (int i = k-1; i >= 0; i--){
		printf("%d ", scmax[i]);
	}
	printf("\n");
	return 0;
}