/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define N 510
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
ll a[N],D[N][N];
int O[N][N],n;
ll solve(int x,int y)
{
    if(O[x][y])
        return D[x][y];
    if(x==y)
        return 0;
    O[x][y]=1;
    D[x][y]=(1LL<<60);
    FOR(i,x,y-1)
    {
        D[x][y]=min(D[x][y],solve(x,i)+solve(i+1,y)+a[x]*a[i+1]*a[y+1]);
    }
    return D[x][y];
}
int main ()
{
    f>>n;
    FOR(i,1,n+1)
    f>>a[i];
    g<<solve(1,n);
    return 0;
}