#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=101;
int n,a[maxn],f[maxn][maxn],p[maxn];
int main()
{
	freopen("shizi.in","r",stdin);
	freopen("shizi.out","w",stdout);
	memset(f,0x7f,sizeof(f));
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
	  scanf("%d",&a[i]);
	  f[i][i]=0;
	  p[i]=p[i-1]+a[i];
	}
	for(int i=1;i<n;i++)
	  for(int j=1;j<n;j++)if(j+i<=n)
	  {
	  	for(int k=0;k<i;k++)
		  f[j][j+i]=min(f[j][j+k]+f[j+k+1][j+i]+p[j+i]-p[j-1],f[j][j+i]);
	  }
	printf("%d",f[1][n]);
	return 0;
}