#include<fstream>
using namespace std;
int n, v[503], L[503], C[503], D[503][503], i, j, l, k;
int minim(int x, int y){
    return x<y?x:y;
}
ifstream in("podm.in");
ofstream out("podm.out");
int main(){
    in>>n;
    in>>v[1];
    for(i=2; i<=n+1; i++){
        in>>v[i];
        L[i-1]=v[i-1];
        C[i-1]=v[i];
    }
    for(i=1; i<=n; i++)
        D[i][i]=0;
    for(l=2; l<=n; l++){
        for(i=1; i+l-1<=n; i++){//pozitiile de inceput ale secv delungime L
            j=i+l-1;
            D[i][j]=999999999;
            for(k=i; k<j; k++){
                D[i][j]=minim(D[i][j], D[i][k]+D[k+1][j]+L[i]*C[k]*C[j]);
            }
        }
    }
    out<<D[1][n];
    return 0;
}