#include <fstream>
#include <algorithm>

using namespace std;

int a[100005];
int lis[100005];
int l[100005];
int t[100005];

ifstream f("scmax.in");
ofstream g("scmax.out");

void afis(int i) {
    if(i) {
        afis(t[i]);
        g << a[i] << " ";
    }
}

bool cmp(int A, int B) {
    if(lis[A] == lis[B]) return a[A] < a[B];
    return lis[A] > lis[B];
}

int main()
{
    int n, m = 0, p; f >> n;
    for(int i = 1; i <= n; i ++) f >> a[i];
    l[0] = 1; l[1] = 0;
    for(int i = 1; i <= n; i ++) {
        int j = 0;
        while(a[l[j]] >= a[i]) j ++;
        t[i] = l[j];
        lis[i] = lis[l[j]] + 1;
        if(lis[i] > m) m = lis[i], p = i;
        l[0] ++; l[l[0]] = i;
        sort(l + 1, l + l[0] + 1, cmp);
    }
    g << m << "\n";
    afis(p); g << "\n";
    return 0;
}