#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <bitset>
#include <utility>

#define rep(i,a,b) for(int i=int(a); i<=int(b); ++i)
#define rev(i,b,a) for(int i=int(b); i>=int(a); --i)
#define rec(i,a,b,c) for(int i=int(a); i<=int(b); i+=int(c))
#define recv(i,a,b,c) for(int i=int(a); i>=int(b); i-=int(c))
#define mp(x,y) make_pair((x),(y))
#define pb(x) push_back(x)
#define all(c) c.begin(), c.end()
#define tr(container, it) for(auto it=(container).begin(); it != (container).end(); ++it)
#define sqr(x) ((x)*(x))
#define sz(a) int((a).size())
#define mod(a,n) ((a) < 0 ? ((n)+(a)) : ((a)%(n)))
#define mout(M,n,m) rep(i,1,(n)){ rep(j,1,(m)) cout << (M)[i][j] << " ";  cout << "\n"; }
using namespace std;

#define INF 300000

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

int main(){

  freopen("podm.in", "r", stdin);
  freopen("podm.out", "w", stdout);

  int n;
  scanf("%d", &n);
  vector<pair<int,int> > M(n+1);
  vector<vector<int> > D(n+2, vector<int>(n+2, INF));
  scanf("%d %d", &M[1].first, &M[1].second);
  rep(i,2,n){
    int v;
    scanf("%d", &M[i].second);
    M[i].first = M[i-1].second;
  }

  rep(i,1,n)
    D[i][i] = 0;
  rep(i,1,n-1)
    D[i][i+1] = M[i].first * M[i].second * M[i+1].second;

  rep(k,2,n)
    rep(i,1,n-k)
      rep(j,i,i+k)
        D[i][i+k] = min(D[i][i+k], D[i][j] + D[j+1][i+k] + M[i].first*M[j].second*M[i+k].second);

  printf("%d\n", D[1][n]);

  return 0;
}