#include <stdio.h>
#include <stdlib.h>
#define N 500
#define INF (1LL << 60)

long long dp[N + 1][N + 1];
int a[N + 2], n;

long long min(long long x, long long y)
{
    return (x < y ? x : y);
}

int main()
{
    FILE *in, *out;
    in = fopen("podm.in", "r");
    out = fopen("podm.out", "w");
    fscanf(in, "%d", &n);
    int i, j, k;
    for (i = 1; i <= n + 1 ; i++)
    {
        fscanf(in, "%d", &a[i]);
    }
    fclose(in);
    for (i = n - 1; i >= 1; i--)
    {
        for (j = i + 1; j <= n; j++)
        {
            ///calculez dp[i][j] = nr min de inm elem pentru prod matr de la i la j
            dp[i][j] = INF;
            for (k = i; k < j; k++)
            {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + (long long)a[i] * a[k+1] * a[j+1]);
            }
        }
    }
    fprintf(out, "%lld", dp[1][n]);
    fclose(out);
    return 0;
}