#include<bits/stdc++.h>
#define LL long long
#define MAXSIZE 1005
#define INF 0x3f3f3f3f

using namespace std;

int dp[MAXSIZE][MAXSIZE],val[MAXSIZE],pre[MAXSIZE];

int Solve(int n)
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            dp[i][j] = INF;
    }
    for(int i=1;i<=n;i++)
    {
        dp[i][i] = 0;
        pre[i] = pre[i-1] + val[i];
    }
    for(int i=n;i>=1;i--)
    {
        for(int j=i+1;j<=n;j++)
        {
            for(int k=i;k<j;k++)
            {
                dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+pre[j]-pre[i-1]);
            }
        }
    }
    return dp[1][n];
}

int main()
{
    //freopen("shizi.in","r",stdin);
    //freopen("shizi.out","w",stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&val[i]);
    int ans = Solve(n);
    printf("%d\n",ans);
    return 0;
}