#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int a[100005];
vector< pair<int, int> > l;
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(pair<int, int> A, pair<int, int> B) {
    if(A.first == B.first) return a[A.second] < a[B.second];
    return A.first > B.first;
}

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