#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

int n; int a[310]; int d[310][310]; int sum[310];
int main() { cin >> n; sum[0]=0; for(int i=1;i<=n;i++) { cin >>a[i]; sum[i]= sum[i-1]+a[i]; }
for(int len =2;len <=n;len)
for(int i =1;i+len -1<=n;i)
{
int l =i,r = i+len -1;
d[l][r] = 1e8;
for(int k =l;k<r;k++)
{
d[l][r] = min(d[l][k]+d[k+1][r]+ (sum[r]-sum[l-1]),d[l][r]) ;
}
}
cout <<d[1][n]<<endl;
return 0;
}`