#include<bits/stdc++.h>
using namespace std;
int n,d[31],jl[31][31];
int dp[31][31],ans=INT_MIN;
vector<int>v[31];
void dfs(int l,int r){
	if(l>r||l<0||r<0)return;
	int root=jl[l][r];
	cout<<root<<' ';
	if(r!=l){
		dfs(l,root-1);
		dfs(root+1,r);	
	}
}
int main(){
	freopen("jfecs.in","r",stdin);
	freopen("jfecs.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>d[i];
		dp[i][i]=d[i];
		dp[i-1][i]=d[i-1]+d[i];
		jl[i][i]=i;
	}
	for(int l=2;l<=n;l++){
		for(int s=1;s<=n-l+1;s++){
			int e=s+l-1;
			for(int j=s+1;j<e;j++){
				if(dp[s][j-1]*dp[j+1][e]+d[j]>dp[s][e]){
					dp[s][e]=dp[s][j-1]*dp[j+1][e]+d[j];
					jl[s][e]=j;
				}
			}
			if(l==2){
				jl[s][e]=s;
			}
		}
	}
	cout<<dp[1][n]<<endl;
	dfs(1,n);
	fclose(stdin);
	fclose(stdout);
	return 0;
}