#include<bits/stdc++.h>
using namespace std;
const int N=314;
int n,m,k,s,t,a[N],sum[N],f[N][N];
int main(){
    cin>>n;
    memset(f,0x3f,sizeof(f));
    for(int i=1;i<=n;++i){
        cin>>a[i];
        sum[i]=sum[i-1]+a[i];
        f[i][i]=0;
    }
    for(int len=1;len<n;++len){
        for(int l=1;l+len<=n;++l){
            int r=l+len;
            for(int k=l;k<r;++k){
                f[l][r]=max(f[l][k],f[k+1][r]);
            }
            f[l][r]+=sum[r]-sum[l-1];
        }
    }
    cout<<f[1][n];
}