#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxN = 512;
int d[maxN][maxN];
int v[maxN];

int main() {
  freopen("podm.in", "r", stdin);
  freopen("podm.out", "w", stdout);
  int N, a, b, c;

  scanf("%d", &N);
  for(int i = 1; i <= N + 1; ++ i)
    scanf("%d", &v[i]);

  for(int i = 1; i < N; ++ i)
    d[i][i + 1] = v[i] * v[i + 1] * v[i + 2];

  for(int i = 2; i < N; ++ i) {
    for(int j = 1; j + i <= N; ++ j) {
      int minimul = (1LL << 30) - 1;
      for(int k = j; k < j + i; ++ k)
        minimul = min(minimul, d[j][k] + d[k + 1][j + i] + v[j] * v[j + i + 1] * v[k + 1]);
      d[j][j + i] = minimul;
    }
  }

  printf("%d\n", d[1][N]);
  return 0;
}