#include<bits/stdc++.h>
using namespace std;
int n,a[310],f[310][310];
int main(){
    cin >> n;
    memset(f,0x3f,sizeof(f));
    for(int i=1;i<=n;i++){
        cin >> a[i];
        a[i]+=a[i-1];
        f[i][i]=0;
    }
    for(int l=2;l<=n;l++){
        for(int i=1;i-l+1<=n;i++){
            int j=i+l-1;
            for(int k=i;k<=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];
    return 0;
}