#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int f[101][101];
int c[101];
int n,i,j,k,x;
int min(int a,int b)
{
	return a>b?b:a;
}
int main()
{
	freopen("shizi.in","r",stdin);
	freopen("shizi.out","w",stdout);
	scanf("%d",&n);
	c[1]=0;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x);
		c[i]=c[i-1]+x;
	}
	memset(f,127/3,sizeof(f));
	for(i=1;i<=n;i++) f[i][i]=0;
	for(i=n-1;i>=1;i--)
		for(j=i+1;j<=n;j++)
			for(k=i;k<=j-1;k++)
				f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]+c[j]-c[i-1]);
	printf("%d\n",f[1][n]); 
	fclose(stdin);
	fclose(stdout);
	return 0;
}