#include<iostream>
#include<fstream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<bitset>
#include<cstring>
#include<queue>
#include<stack>

#define ull unsigned long long
#define ll long long
#define pb push_back
#define FOR(a,b,c) for (int a=b;a<=c; ++a)
#define ROF(a,b,c) for (int a=b;a>=c; --a)

using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int N;
int v[5010],best[5010],pre[5010],urm[5010];
bool verif[5010];

void afiseaza(int x) {
    if (x!=0) {
        afiseaza(pre[x]);
        g<<x<<' ';
    }
}

int main()
{
    f>>N;
    FOR (i,1,N) {
        f>>v[i];
    }
    best[1]=1;
    urm[1]=5010;
    int max1=1;
    FOR (i,2,N) {
        urm[i]=5010;
        best[i]=5010;
        FOR (j,1,i-1) {
            if (v[j]<=v[i]) {
                verif[j]=true;
                if (urm[j]>v[i] && (best[j]+1<best[i] || (best[j]+1==best[i] && v[pre[i]]>v[j]))) {
                    best[i]=best[j]+1;
                    pre[i]=j;
                    urm[j]=v[i];
                }
            }
        }
        if (best[i]==5010) {
            best[i]=1;
        }
        /*
        if (best[i]>max1) {
            max1=best[i];
        }*/
    }/*
    FOR (i,1,N) {
        cout<<best[i]<<' ';
    }
    cout<<'\n';
    FOR (i,1,N) {
        cout<<pre[i]<<' ';
    }
    cout<<'\n';
    FOR (i,1,N) {
        cout<<urm[i]<<' ';
    }
    cout<<'\n';
    FOR (i,1,N) {
        cout<<verif[i]<<' ';
    }*/
    int min1=5010,x=0;
    ROF (i,N,1) {
        if (!verif[i]) {
            if (best[i]<min1) {
                min1=best[i];
                x=i;
            }
            else if (best[i]==min1 && v[x]>v[i]) {
                min1=best[i];
                x=i;
            }
        }
    }
    g<<min1<<'\n';
    afiseaza(x);
    f.close();g.close();
    return 0;
}