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

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

const int MAXN = 5010;

int l[MAXN],r[MAXN],x[MAXN],i,j,n,m,mi,mr,next[MAXN];

int main()
{
	in>>n;
	for(i=1; i<=n; i++)
		in>>x[i], r[i] = l[i] = 1;
		
	l[1] = 1;
	for(i=2; i<=n; i++)
		for(j=1; j<i; j++)
			if(x[j] <= x[i] && l[i]<l[j]+1)
				l[i] = l[j]+1;
	r[n] = 1;
	for(i=n-1; i>=1; i--)
		for(j=i+1; j<=n; j++)
			if(x[i] <= x[j] && r[i]<r[j]+1)
				r[i] = r[j]+1, next[i] = j;
			else if(r[i] == r[j]+1 && x[next[i]] > x[j])
				next[i] = j;
	for(i=1; i<=n; i++)
		if(!m || m>l[i]+r[i]-1)
			m = l[i] + r[i] -1, mi=i;
	out<<m<<'\n';
	for(i=1; i<=m; i++)
		out<<mi<<' ', mi=next[mi];
		
	/*out<<'\n';
	for(i=1; i<=n; i++)
		out<<next[i]<<' ';*/
	
	return 0;
}