#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 305 , inf = 0x3f3f3f3f;
int n,a[maxn];
int f[maxn][maxn]; //f[i][j] 表示 将i~j堆的石子合并的最小代价 
int main()
{
    cin>>n;
    for(int i=1;i<=n;++i) cin>>a[i],a[i]+=a[i-1];  //变为前缀和 
    memset(f,0x3f,sizeof f);
    for(int i=0;i<=n;++i) f[i][i] = 0;
    for(int i=n;i>=1;--i)
        for(int j=i+1;j<=n;j++)
            for(int k=i;k+1<=j;++k)
                f[i][j] = min(f[i][j],f[i][k]+f[k+1][j]+a[j]-a[i-1]);
    cout<<f[1][n]<<endl;
    return 0;
}