#include<cstdio>
#include<cstdlib> 
#define N 35
using namespace std;
int n,a[N],f[N][N],p[N][N],ak,ans;
void print(int i,int j)
{
	int k=p[i][j];
	printf("%d ",k);
	if(i==j)return;
	if(i<k)print(i,k-1);
	if(k<j)print(k+1,j);
}
int main(){
	freopen("jfecs.in","r",stdin);freopen("jfecs.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",a+i);
	for(int i=1;i<=n;i++)f[i][i]=a[i],p[i][i]=i;
	for(int l=2;l<=n;l++)
		for(int i=1;i<=n-l+1;i++)
		{
			int j=i+l-1;
			if(f[i][j-1]>f[i+1][j])
				f[i][j]=f[i][j-1]+a[j],p[i][j]=j-1;
			else
				f[i][j]=f[i+1][j]+a[i],p[i][j]=i;
			for(int k=i+1,sum;k<j;k++)
			{
				sum=f[i][k-1]*f[k+1][j]+a[k];
				if(sum>f[i][j])
					f[i][j]=sum,p[i][j]=k;
			}
		}
	printf("%d\n",f[1][n]);
	print(1,n);
	return 0;
}