// infoarena: problema/subsir2 //
#include <fstream>
#define MAXN 5010
using namespace std;

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

int x[MAXN],i,j,s[MAXN],k[MAXN],m,n,l,p,q,r[MAXN],minim;

int main()
{
	in>>n;
	for(i=1; i<=n; i++)
		in>>x[i];
	
	s[n] = 1;
	for(i=n; i>=1; i--)
	{
		m = 0;
		for(j=i+1; j<=n; j++)
		{
			if(x[j] > minim && (x[j] >= x[i] && s[j] > s[m] || (x[j] < x[m] && x[j] >= x[i] && s[j] == s[m])))
				m = j;
			minim = min(minim, x[j]);
		}
			
		s[i] = s[m] + 1;
		k[i] = m;
		if(s[q] < s[i] || s[q] == s[i] && x[q] > x[i])
			q = i;
	}
	
	out<<s[q]<<'\n';
	p = q;
	
	while(p)
	{
		out<<p<<' ';
		r[++r[0]] = p;
		p = k[p];
	}
	/*
	for(i=r[0]; i>=1; --i)
		out<<r[i]<<' ';
	*/
	return 0;
}