#include <algorithm>
#include <cstdio>
#include <iostream>

using namespace std;

constexpr int N = 33;

int n;
long long dp[N][N];
int rt[N][N];

void display (int l, int r) {
	if (l > r) {
		return;
	}
	if (l == r) {
		cout << l << ' ';
		return;
	}
	cout << rt[l][r] << ' ';
	display (l, rt[l][r] - 1);
	display (rt[l][r] + 1, r);
}

int main () {
	
	freopen ("jfecs.in", "r", stdin);
	freopen ("jfecs.out", "w", stdout);

	cin >> n;
	for (int i = 0; i <= n + 1; i++) {
		for (int j = 0; j <= n + 1; j++) {
			dp[i][j] = 1;
		}
	}
	for (int i = 1; i <= n; i++) {
		cin >> dp[i][i];
	}
	for (int len = 2; len <= n; len++) {
		for (int i = 1, j = i + len - 1; j <= n; i++, j++) {
			for (int k = i; k <= j; k++) {
				long long num = dp[i][k - 1] * dp[k + 1][j] + dp[k][k];
				if (num > dp[i][j]) {
					dp[i][j] = num;
					rt[i][j] = k;
				}
			}
		}
	}

	cout << dp[1][n] << endl;
	display (1, n);
	
	return 0;
}