#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstring>
#include<deque>
#define itn int
#define coder goodboy
using namespace std;
typedef long long LL;typedef unsigned long long ULL;
const int maxn=110;
int n,a[maxn],s[maxn],f[maxn][maxn],f2[maxn][maxn];
inline void in(){
//	freopen("a.in","r",stdin);
	freopen("shizi.in","r",stdin);
	freopen("shizi.out","w",stdout);
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		s[i]=s[i-1]+a[i];
	}
}
inline void dp(){
	memset(f,127/3,sizeof(f));
	for (int i=1;i<=n;i++) f[i][i]=0;
	for (int i=n-1;i>=1;i--){
		for (int j=i+1;j<=n;j++){
			for (int k=i;k<=j-1;k++){
				f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]+s[j]-s[i-1]);
			}
		}
	}
}
inline void p(){
	printf("%d",f[1][n]);
}
int Main(){
	in();
	dp();
	p();
	return 0;
}
int main(){;}
int goodboy=Main();