#include <bits/stdc++.h>
#define oo 2000000
using namespace std;

int a[5005], best[5005], n, urm[5005];

void Citire()
{
    int i;
    ifstream fin("subsir2.in");
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    fin.close();
}

void Rezolva()
{
    int i, maxx, lgmin, j, p, x;
    best[n] = 1;
    urm[n] = oo;
    for (i = n - 1; i >= 1; --i)
    {
        x = a[i];
        /// maxx retine cea mai mica valoare strict mai mare ca x
        maxx = oo;
        lgmin = oo;
        p = oo;
        for (j = i + 1; j <= n; ++j)
            if (x <= a[j] && a[j] < maxx)
            {
                maxx = a[j];
                if (lgmin >= best[j])
                {
                    lgmin = best[j];
                    p = j;
                }
            }
        if (lgmin == oo)
        {
            best[i] = 1;
            urm[i] = oo;
        }
        else
        {
            best[i] = 1 + lgmin;
            urm[i] = p;
        }
    }

    /// caut cea mai mica valoare best[i], cu a[i]=min{a1,a2,...ai}.
    x = a[1]; p = 1;
    for (i = 2; i <= n; ++i)
        if (a[i] < x)
        {
            x = a[i];
            if (best[i] <= best[p]) p = i;
        }

    ofstream fout("subsir2.out");
    fout << best[p] << "\n";

    while (p != oo)
    {
        fout << p << " ";
        p = urm[p];
    }
    fout << "\n";
    fout.close();
}

int main()
{
    Citire();
    Rezolva();
    return 0;
}