#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 505;
const ll inf = 1LL << 62;

int n, i, j, k, l, d[nmax];
ll dp[nmax][nmax];

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

    scanf("%d", &n);

    for(i = 0; i <= n; i++)
        scanf("%d", &d[i]);

    for(i = 1; i <= n; i++)
        for(j = i; j <= n; j++)
            dp[i][j] = (i == j) ? 0 : inf;

    for(l = 2; l <= n; l++)
        for(i = 1, j = l; j <= n; i++, j++)
            for(k = i; k < j; k++)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * d[i - 1] * d[k] * d[j]);

    printf("%lld\n", dp[1][n]);

    return 0;
}