#include <bits/stdc++.h>
#define MAX 500000
using namespace std;
void update(int *T, int node, int left, int right, int value, int pos, int* best) {
if(left == right) {
T[node] = value;
return;
} else {
int mid = (left + right) / 2;
if(pos <= mid) {
update(T, 2 * node, left, mid, value, pos, best);
} else {
update(T, 2 * node + 1, mid + 1, right, value, pos, best);
}
}
if(best[T[2 * node]] > best[T[2 * node + 1]]) {
T[node] = T[2 * node];
} else {
T[node] = T[2 * node + 1];
}
}
void query(int *T, int nod, int left, int right, int a, int b, int &maxim, int *best) {
if(b < a) {
return;
}
if(left >= a && right <= b) {
if(best[T[nod]] > best[maxim]) {
maxim = T[nod];
}
return;
}
int mid = (left + right) / 2;
if(a <= mid) {
query(T, 2 * nod, left, mid, a, b, maxim, best);
}
if(b > mid) {
query(T, 2 * nod + 1, mid + 1, right, a, b, maxim, best);
}
}
void print_ans(int start, int *fin, int *v) {
if(start == 0) {
return;
}
print_ans(v[start], fin, v);
printf("%d ", fin[start]);
}
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
int n;
int T[MAX], pos;
scanf("%d", &n);
int v[n + 1], ord[n + 1], best[n + 1] = {0}, fin[n + 1];
for(int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
ord[i] = fin[i] = v[i];
}
sort(ord + 1, ord + n + 1);
int cnt = 1;
for(int i = 2; i <= n; i++) {
if(ord[i] != ord[cnt]) {
ord[++cnt] = ord[i];
}
}
for(int i = 1; i <= n; i++) {
v[i] = lower_bound(ord + 1, ord + cnt + 1, v[i]) - ord;
}
for(int i = 1; i <= n; i++) {
pos = 0;
query(T, 1, 1, n, 1, v[i] - 1, pos, best);
best[i] = best[pos] + 1;
update(T, 1, 1, n, i, v[i] , best);
v[i] = pos;
}
int ans = 0, start;
for(int i = 1; i <= n; i++) {
if(best[i] > ans) {
ans = best[i];
start = i;
}
}
printf("%d\n", ans);
print_ans(start, fin, v);
return 0;
}