#include <bits/stdc++.h>
const int MAX_N = 5005;

using namespace std;

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

int n, l, x, lmin=MAX_N, v[MAX_N], sol[MAX_N], mini[MAX_N], pozmini;

int main()
{
    int i, j;
    fin>>n;
    mini[0]=10000000;
    for(i=1; i<=n; i++) {
        fin>>v[i];
        mini[i]=min(mini[i-1], v[i]);
    }
    for(i=1; i<=n; i++)
        if(v[i]==mini[i]) {
            l=1;
            x=v[i];
            for(j=i+1; j<=n; j++)
            if(v[j]>=x) {
                l++;
                x=v[j];
            }
            if(l<lmin) {
                lmin=l;
                l=1;
                x=v[i];
                sol[l]=i;
                for(j=i+1; j<=n; j++)
                if(v[j]>=x) {
                    l++;
                    sol[l]=j;
                    x=v[j];
                }
            }
        }
    fout<<lmin<<'\n';
    for(i=1; i<=lmin; i++)
        fout<<sol[i]<<" ";
    return 0;
}