//主要是要找到dp[i][j]表示什么,该题中表示第i堆到第j堆的总个数,这个题要注意要加上i堆到j堆的
//还要注意的是要提前写好堆到堆的距离
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int array[] = new int[n]; //存储输入的数
int sum[][] = new int[1001][1001]; //存储堆到对之间的距离
int dp[][] = new int[1001][1001]; //第i堆到j堆的总个数
for(int i = 0; i < n; i++){
array[i] = scanner.nextInt();
sum[i][i] = array[i];
}
//注意要先计算堆到堆的距离
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
sum[i][j] = sum[i][j - 1] + array[j];
}
}
for(int r = 1; r < n; r++){
for(int i = 0; i < n - r; i++){
int j = r + i;
dp[i][j] = Integer.MAX_VALUE;
for(int k = i; k < j; k++){
if(dp[i][j] > dp[i][k] + dp[k + 1][j]){
dp[i][j] = dp[i][k] + dp[k + 1][j];
}
}
dp[i][j] += sum[i][j];
}
}
System.out.println(dp[0][n - 1]);
scanner.close();
}
}