#include <fstream>
using namespace std;

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

const int MAXN = 5005;
const int INF = 1000005;

int n;

int v[MAXN];

void citire()
{
    in >> n;
    for (int i = 1;i <= n;++i)
        in >> v[i];
}

//l[i] - lungimea celui mai lung subsir crescator care incepe cu pozitia i
int l[MAXN];

//urm[i] - urmatorul element in cadrul subsirului crescator maximal
int urm[MAXN];

void dinamica()
{
    l[n] = 1;
    for (int i = n - 1;i >= 1;--i)
    {
        l[i] = 1;
        int minl = INF;
        int pozmin = 0;
        for (int j = i + 1;j <= n;++j)
            if (v[j] < minl && v[j] >= v[i])
            {
                minl = v[j];
                pozmin = j;
            }
        l[i] = l[pozmin] + 1;
        urm[i] = pozmin;
    }
}

void afisare()
{
    int maxl = -1;
    int pozmax;
    for (int i = 1;i <= n;++i)
        if (l[i] > maxl)
        {
            maxl = l[i];
            pozmax = i;
        }
    out << l[pozmax] << '\n';
    while(urm[pozmax] != 0)
    {
        out << pozmax << ' ';
        pozmax = urm[pozmax];
    }
    out << pozmax << '\n';
}

int main()
{
    citire();
    dinamica();
    afisare();
    return 0;
}