#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 #define N 105

 typedef long long LL;

 LL dp[N][N], w[N];

 int main() {

     int n;

     while(~scanf("%d", &n)) {

         memset(dp, 0x3f3f3f3f, sizeof(dp));

         for(int i = ; i <= n; i++) scanf("%lld", &w[i]);

         for(int i = ; i <= n; i++) dp[i][i] = dp[i][i+] = ;

         //for(int i = 2; i < n; i++) dp[i][i] = w[i-1] * w[i] * w[i+1];

         for(int len = ; len < n; len++) {

             for(int i = ; i + len <= n; i++) {

                 int j = i + len;

                 for(int k = i + ; k < j; k++)

                     dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + w[i] * w[j] * w[k]);

             }

         }

         printf("%lld\n", dp[][n]);

     }

     return ;

 }