#include <bits/stdc++.h>

using namespace std;
ifstream fin ("subsir2.in");
ofstream fout("subsir2.out");
const int nmax = 5000 + 50;
int n, v[nmax], dp[nmax], urm[nmax];
bool marked[nmax];
int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin  >> v[i];
    }

    for (int i = n; i >= 1; --i) {
        int nr = INT_MAX;
        dp[i] = n + 1;
        marked[i] = true;
        for (int j = i + 1; j <= n; ++j) {
            if (v[j] >= v[i]) {
                marked[j] = false;
            }

            if (v[j] >= v[i] && v[j] < nr) {
                if (dp[j] <= dp[i]) {
                    dp[i] = dp[j];
                    urm[i] = j;
                }

                nr = v[j];
            }
        }

        if (dp[i] == n + 1)
            dp[i] = 1;
        else
            dp[i] ++;
    }

    int mini = INT_MAX, poz;
    for (int i = 1; i <= n; ++i) {
        if (marked[i]) {
            if (dp[i] < mini) {
                mini = dp[i];
                poz = i;
            }
            else if (dp[i] == mini && v[poz] > v[i]){
                poz = i;
            }
        }
    }

    //cout << dp[2];
    fout << mini << '\n';
    fout << poz << ' ';
    while(urm[poz]) {
        fout << urm[poz] << ' ';
        poz = urm[poz];
    }

    return 0;
}