#include<bits/stdc++.h>
using namespace std;
int n,s[40],dp[40][40],r[40][40];
void dfs(int b,int e)
{
	if(r[b][e]<0)return ;
	int o=r[b][e];
	printf("%d ",r[b][e]);
	if(o>b)dfs(b,o-1);
	if(o<e)dfs(o+1,e);
}
int main()
{
	freopen("jfecs.in","r",stdin);
	freopen("jfecs.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)scanf("%d",&s[i]),dp[i][i]=s[i],r[i][i]=i;
	for(int p=1;p<n;p++)
	{
		for(int i=1;i+p<=n;i++)
		  {
		  	int j=i+p;
		  	for(int k=i;k<=j;k++)
		  	{
		  		int sum;
		  		if(k==i)sum=dp[i][i]+dp[i+1][j];
		  		else if(k==j)sum=dp[j][j]+dp[i][j-1];
		  		else sum=dp[i][k-1]*dp[k+1][j]+dp[k][k];
		  		if(sum>dp[i][j]){
		  			dp[i][j]=sum;
		  			r[i][j]=k;
				  }
			  }
		  }
	}
	printf("%d\n",dp[1][n]);
	dfs(1,n);
	return 0;
}