#include<bits/stdc++.h>
using namespace std;
const int N = 109;
int n;
int a[N << 1];
int f[N << 1][N << 1];
int ans;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	memset(f,128,sizeof f);
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> a[i];
		a[i + n] = a[i];
		f[i][i] = 0;
	}
	for(int len = 2;len <= n;len++){
		for(int i = 1;i <= n;i++){
			int j = i + len - 1;
			for(int k = i;k < j;k++){
				f[i][j] = max(f[i][j],f[i][k] + f[k + 1][j] + a[i - 1] * a[k] * a[j]);
			}
		}
	}
	for(int i = 1;i <= n;i++)
		ans = max(ans,f[i][i + n - 1]);
	cout << ans;
	return 0;
}