#include <iostream>
#include <fstream>
#include <algorithm>
#include <stack>

using namespace std;

ifstream in("subsir2.in");
ofstream out("subsir2.out");

int v[100003];
int s[100003];
int o[100003];
int k;

deque<int> deq;

int main() {

    int n;
    in >> n;

    for(int i = 0; i < n; i++)
        in >> v[i];

    for(int i = 0; i < n; i++) {

        while(!deq.empty() && v[deq.front()] > v[i])
            deq.pop_front();
        deq.push_front(i);

    }

    out << deq.size() << '\n';

    while(!deq.empty()) {

        out << deq.back()+1 << " ";
        deq.pop_back();

    }

    int poz = 0;

    return 0;
}