#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int N=105;
int a[N],f[N][N];
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        a[i]+=a[i-1];
    }
    memset(f,127,sizeof(f));
    for(int i=1;i<=n;i++)f[i][i]=0;
    for(int i=n-1;i>0;i--){
        for(int j=i+1;j<=n;j++){
            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;
}