#include<fstream>
#define NMAX 5010

using namespace std;

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

int n, ind, a[NMAX], lg[NMAX], prec[NMAX];

void Citeste()
{
    int i;
    f>>n;
    for (i=1; i<=n; ++i) f>>a[i];
}

void Solve()
{
    int i, j, mn, imn, minim;
    lg[n]=1; prec[n]=-1;
    for (i=n-1; i>0; --i)
    {
        minim=1000010; imn=0; mn=n+1; imn=0;
        for (j=i+1; j<=n; ++j)
            if (a[j]>=a[i])
            {
                if (minim>a[j])
                {
                    minim=a[j];
                    if (lg[j]<mn)
                    {
                        mn=lg[j];
                        imn=j;
                    }
                    else
                        if (lg[j]==mn && a[imn]>a[j]) imn=j;
                }
            }
        if (mn==n+1)
        {
            lg[i]=1;
            prec[i]=-1;
        }
        else
        {
            lg[i]=lg[imn]+1;
            prec[i]=imn;
        }
    }
}

void Scrie()
{
    int i, j, x, mn=lg[1], imn=1, ok;

    for (i=2; i<=n; ++i)
    {
        ok=1;
        for (j=1; j<i; ++j)
            if (a[i]>=a[j])
            {
                ok=0;
                break;
            }
        if (ok)
        {
            if (mn>lg[i])
            {
                mn=lg[i];
                imn=i;
            }
            else
                if (mn==lg[i] && a[imn]>a[i]) imn=i;
        }
    }
    g<<mn<<"\n";
    x=imn;
    while (x!=-1)
    {
        g<<x<<" ";
        x=prec[x];
    }
    g<<"\n";
}

int main()
{
    Citeste();
    Solve();
    Scrie();
    /*int i;
    for (i=1; i<=n; ++i) g<<"  "<<lg[i]<<"  ";
    g<<"\n";
    for (i=1; i<=n; ++i) g<<"  "<<prec[i]<<"  ";
    g<<"\n";*/
    f.close();
    g.close();
    return 0;
}