package 第十一届蓝桥杯;

import java.util.Scanner;

public class 超级胶水 {

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);

        int n = in.nextInt();

        int[] a = new int[1010];

        int[][] temp = new int[1010][1010];

        int[][] dp = new int[1010][1010];

        int[][] jiaoshui = new int[1010][1010];

//        int[][] jiao = new int[1010][1010];

//        int[][] zong = new int[1010][1010];

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

            a[i] = in.nextInt();

            temp[i][i] = a[i];

//            jiao[i][i]=a[i];

            dp[i][i]=a[i];

        }

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

            for(int j=i+1; j<=n; j++) {

                temp[i][j] = temp[i][j-1] + a[j];

//                jiao[i][j]=jiao[i][j-1]*a[i];

            }

        }

        for (int r=2; r<=n; r++) {

            for (int i=1; i<=n-r+1; i++) {

                int j=i+r-1;

                jiaoshui[i][j] = Integer.MAX_VALUE;

                dp[i][j] = Integer.MAX_VALUE;

                int temp1 = 0;

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

                    if(jiaoshui[i][j] > dp[i][k] * dp[k+1][j])

                        temp1=k;

                        dp[i][j] = dp[i][k] + dp[k+1][j];

                    jiaoshui[i][j] = dp[i][k] * dp[k+1][j];

                }

                jiaoshui[i][j]+=jiaoshui[i][temp1];

                jiaoshui[i][j]+=jiaoshui[temp1+1][j];

//                dp[i][j] += temp[i][j];

//                jiaoshui[i][j]*=jiao[i][j];

            }

        }

//        System.out.println(dp[1][n]);

        System.out.println(jiaoshui[1][n]);

//        System.out.println(zong[1][n]);

    }

}