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

int N;
long long M[510][501], P[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", &P[i]);
    }
    for(int w = 1; w <= N; w++){
        for(int i = 1; i <= N - w; i++){
            int j = i + w;
            M[i][j] = 1LL << 60;

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