石子合并(直线)

//#include<bits/stdc++.h>
#include<algorithm>
#include <iostream>
#include  <fstream>
#include  <cstdlib>
#include  <cstring>
#include  <cassert>
#include   <cstdio>
#include   <vector>
#include   <string>
#include    <cmath>
#include    <queue>
#include    <stack>
#include      <set>
#include      <map>
using namespace std;
#define P(a,b,c) make_pair(a,make_pair(b,c))
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define CLR(vis) memset(vis,0,sizeof(vis))
#define MST(vis,pos) memset(vis,pos,sizeof(vis))
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef pair<int,pair<int,int> >pii;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000007;
const int INF = 0x3f3f3f3f;
ll gcd(ll a, ll b) {
	return b ? gcd(b, a%b) : a;
}
template<class T>inline void gmax(T &A, T B) {
	(A<B)&&(A=B);//if(B>A)A=B;
}
template<class T>inline void gmin(T &A, T B) {
	(A>B)&&(A=B);//if(B<A)A=B;
}
template <class T>
inline bool scan_d(T &ret) {
	char c;
	int sgn;
	if(c=getchar(),c==EOF) return 0; //EOF
	while(c!='-'&&(c<'0'||c>'9')) c=getchar();
	sgn=(c=='-')?-1:1;
	ret=(c=='-')?0:(c-'0');
	while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
	ret*=sgn;
	return 1;
}
inline void outt(int x) {
	if(x>9) outt(x/10);
	putchar(x%10+'0');
}
const int MAXN = 1e6+10;
int f[110][110];
int a[110];
int sum[110];
int main() {
	ios::sync_with_stdio( false );
	
	int n;
	while(cin>>n) {
		MST(f,0x3f);
		sum[0]=0;
		rep(i,1,n) {
			cin>>a[i];
			f[i][i]=0;
			sum[i]=sum[i-1]+a[i];
		}
		rep(len,2,n)
		rep(l,1,n-len+1) {
			int r=l+len-1;
			rep(k,l,r-1) {
				f[l][r]=min(f[l][r],f[l][k]+f[k+1][r]);
			}
			f[l][r]+=sum[r]-sum[l-1];
		}
//		cout<<f[1][n]<<" ";
//		MST(f,-INF);
//		rep(i,1,n)f[i][i]=0;
//		rep(len,2,n)
//		rep(l,1,n-len+1) {
//			int r=l+len-1;
//			rep(k,l,r-1) {
//				f[l][r]=max(f[l][r],f[l][k]+f[k+1][r]);
//			}
//			f[l][r]+=sum[r]-sum[l-1];
//		}
		cout<<f[1][n]<<endl;
	}
	return 0;
}