#include <fstream>
#include <algorithm>

using namespace std;

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

const int maxN = 5005;
int n, v[maxN], dp[maxN], nxt[maxN], start, ans;

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> v[i];
    for(int i = n; i >= 1; i--)
    {
        int mini = 0x3f3f3f3f;
        dp[i] = 1;
        for(int j = i + 1; j <= n; j++)
        {
            if(v[j] < v[i] || v[j] > mini)
                continue;
            if(dp[j] + 1 >= dp[i])
            {
                dp[i] = dp[j] + 1;
                nxt[i] = j;
            }
            mini = v[j];
        }
        if(dp[i] > ans)
        {
            ans = dp[i];
            start = i;
        }
    }
    fout << ans << '\n';
    for(int x = start; x != 0; x = nxt[x])
        fout << x << ' ';
    return 0;
}