#include <iostream>

#define NMax 505
#define Inf 2000000000

using namespace std;

int N, D[NMax], Best[NMax][NMax];

void Read ()
{
    freopen ("podm.in", "r", stdin);
    scanf ("%d", &N);
    for (int i=1; i<=N+1; ++i)
    {
        scanf ("%d", &D[i]);
    }
}

void Print ()
{
    freopen ("podm.out", "w", stdout);
    printf ("%d\n", Best[1][N]);
}

inline int Min (int a, int b)
{
    if (a<b)
    {
        return a;
    }
    return b;
}

int main()
{
    Read ();
    for (int d=1; d<N; ++d)
    {
        for (int i=1; i+d<=N; ++i)
        {
            int j=i+d;
            Best[i][j]=Inf;
            for (int k=i; k<j; ++k)
            {
                Best[i][j]=Min (Best[i][j], Best[i][k]+Best[k+1][j]+D[i]*D[k+1]*D[j+1]);
            }
        }
    }
    Print ();
    return 0;
}