#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int f[101][101],s[101],n,x;
int main()
{
	freopen("shizi.in","r",stdin);
	freopen("shizi.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		s[i]=s[i-1]+x;
	}
	memset(f,10000,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]);
	printf("%d\n",f[1][n]);
	return 0;      
}