#include <cstdio>
#include <algorithm>
using namespace std;

int n;
long long dp[501][501], d[501];

int main(){

    freopen("podm.in", "r", stdin);
    freopen("podm.out", "w", stdout);

    scanf("%d", &n);

    for(int i = 0; i <= n; i++){
        scanf("%d", &d[i]);
    }
    for(int i = 1; i < n; i++){
        for(int j = i + 1; j <= n; j++){
            dp[j-i][j] = 1LL << 60;

            for(int k = j - i; k < j; k++){
                dp[j-i][j] = min(dp[j-i][j], dp[j-i][k] + dp[k+1][j] + d[j-i-1] * d[k] * d[j]);
            }
        }
    }
    printf("%d", dp[1][n]);
    return 0;
}