#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define INF 1000000000
using namespace std;
const int MAXN=100+5;
int n,i,j;
int s[MAXN],f[MAXN][MAXN],sum[MAXN][MAXN];
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;						
}
inline void init(){
    n = read();
    for(int i=1;i<=n;i++) s[i]=read();
    for(int i=1;i<=n;i++) {
        f[i][i]=0;
        sum[i][i]=s[i];
        for(int j=i+1;j<=n;j++)
            sum[i][j]=sum[i][j-1]+s[j];
    }
}
inline void work(){
    for(int k=2;k<=n;k++) {
        for(int i=1;i<=n-k+1;i++) {
            j=i+k-1;
            f[i][j]=INF; 
            for(int h=i;h<=j-1;h++) {
                f[i][j]=min(f[i][j],f[i][h]+f[h+1][j]+sum[i][j]); 
            }
        }
    }
}
int Main(){
	freopen("shizi.in","r",stdin);
	freopen("shizi.out","w",stdout);
    init();
    work();
    cout<<f[1][n]<<endl;
    fclose(stdin);
    fclose(stdout);
    return 0;
}
int out=Main();
int main(){;}