#include <fstream>
using namespace std;

ifstream fin("podm.in");
ofstream fout("podm.out");
const long long oo = 1LL<<60;
const int NMax = 505;
int N;
long long DP[NMax][NMax];
int D[NMax];

int main()
{
    fin>>N;
    for(int i = 0; i <= N; ++i)
      fin>>D[i];

    for(int Step = 1; Step < N; Step++)
      for(int i = 1; i <= N - Step; i++)
        {
          int j = i + Step;
          DP[i][j] = oo;
          for(int k = i; k < j; k++)
            DP[i][j] = min(DP[i][j], DP[i][k]+DP[k+1][j]+D[i-1]*D[k]*D[j]);
        }

    return 0;
}