//

 //by coolxxx

 //

 #include<iostream>

 #include<algorithm>

 #include<string>

 #include<iomanip>

 #include<memory.h>

 #include<time.h>

 #include<stdio.h>

 #include<stdlib.h>

 #include<string.h>

 //#include<stdbool.h>

 #include<math.h>

 #define min(a,b) ((a)<(b)?(a):(b))

 #define max(a,b) ((a)>(b)?(a):(b))

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))

 #define eps (1e-8)

 #define J 10000000

 #define MAX 0x7f7f7f7f

 #define PI 3.1415926535897

 #define N 204

 using namespace std;

 typedef long long LL;

 int cas,cass;

 int n,m,lll,ans;

 int a[N];

 int f[N][N];

 int main()

 {

     #ifndef ONLINE_JUDGE

     freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j,l;

 //    for(scanf("%d",&cas);cas;cas--)

 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)

 //    while(~scanf("%s",s))

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

     {

         memset(f,0x7f,sizeof(f));

         for(i=;i<=n+;i++)

         {

             scanf("%d",&a[i]);

             f[i][i]=f[i][i+]=;

         }

         for(l=;l<=n;l++)

             for(i=;i+l<=n+;i++)

                 for(j=i;j<=i+l;j++)

                     f[i][i+l]=min(f[i][i+l],f[i][j]+f[j][i+l]+a[i]*a[j]*a[i+l]);

         printf("%d\n",f[][n+]);

     }

     return ;

 }

 /*

 //

 //

 */