#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#define MAX 100003
#define MINV -1000003

using namespace std;

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

int v[MAX];
int o[MAX];
int b[MAX];
bitset<MAX> u;
vector<vector<int>> stk;
vector<int> tmp;
vector<int> emp;
vector<int> vct;
int k;

int main() {

    int n;
    int maxF = 0;
    in >> n;

    for(int i = 0; i < n; i++) {
        in >> v[i];
        maxF = max(maxF, v[i]);
        o[i] = 1;
        b[i] = -1;
    }
    maxF++;

    int mi;
    int mx;
    bool f = false;

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

        mx = MINV;
        f = false;

        for(int j = i-1; j >= 0; j--) {

            if((v[j] <= v[i] && v[j] >= mx)) {

                if((o[j]+1 < o[i] || !f) || (o[j]+1 == o[i] && v[j]<v[b[i]])) {

                    o[i] = o[j]+1;
                    b[i] = j;
                    u[j] = 1;
                    f = true;

                }

            }

            if(v[j] <= v[i])
                u[j] = 1;

            if(v[j] < v[i])
                mx = max(v[j], mx);

        }

    }

    int miP = -1;

    for(int i = 0; i < n; i++) {
        if(!u[i]) {
            if(miP == -1) {
                miP = i;
                vct.push_back(miP);
            } else {
                if(o[i] < o[miP]) {
                    miP = i;
                    vct.clear();
                    vct.push_back(i);
                } else if(o[i] == o[i]) {
                    vct.push_back(i);
                }
            }
        }
    }

    int M = o[miP];
    int P;

    for(vector<int>::iterator it = vct.begin(); it != vct.end(); it++) {

        P = *it;
        while(P != -1) {
            tmp.push_back(P);
            P = b[P];
        }

        stk.push_back(tmp);
        tmp = emp;

    }

    int PM = 0;

    for(int i = M-1; i >= 0; i--) {
        PM = v[stk.begin()->at(i)];
        for(vector<vector<int>>::iterator it = stk.begin(); it != stk.end(); it++)
            PM = min(v[it->at(i)], PM);
        for(vector<vector<int>>::iterator it = stk.begin(); it != stk.end(); it++) {
            if(v[it->at(i)] != PM) {
                it--;
                stk.erase(it+1);
            }
        }
    }

    vector<vector<int>>::iterator stk2 = stk.begin();

    out << M << '\n';
    for(vector<int>::iterator it = stk2->end()-1; it != stk2->begin()-1; it--)
        out << *it+1 << " ";

    return 0;
}