#include <bits/stdc++.h>
#define Nmax 5005
#define INF 1000005

using namespace std;

int a[Nmax], lis[Nmax];
int urm[Nmax], n, sol[Nmax];

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

void Lis()
{
    lis[n] = 1;
    urm[n] = n + 1;
    sol[n] = a[n];
    for(int i = n - 1; i >= 1; i--)
    {
        int maxim = -INF;
        int minim = INF;
        int p = n + 1;
        int x = a[i];
        for(int j = i + 1; j <= n; j++)
        {
            if(x < a[j] && maxim < lis[j])
            {
                maxim = lis[j];
                p = j;
                minim = min(minim, a[j]);
            }
            else if(x < a[j] && maxim == lis[j])
                if(a[j] < minim)
                    p = j;
            lis[i] = maxim + 1;
            urm[i] = p;
        }
    }
    ofstream g("subsir2.out");
    int m = lis[1];
    int p = 1;
    int val = a[1];
    for(int i = 2; i <= n; i++)
    {
        if(lis[i] > m)
        {
            m = lis[i];
            p = i;
            val = a[i];
        }
        else if(lis[i] == m && val < a[i])
        {
            val = a[i];
            p = i;
        }
    }
    g << m << "\n";
    while(m > 0)
    {
        m--;
        g << p << " ";
        int minim = INF;
        for(int i = p + 1; i <=n; i++)
            if(lis[i] == m && a[i] > val && val < minim)
                p = i;
        val = a[p];
    }
    g << "\n";
    g.close();
}

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