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

int n, a[110], f[110][110], s[110];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        s[i] = s[i - 1] + a[i];
    }
    memset(f, 0x3f, sizeof(f));
    for(int i = 1; i <= n; i++)
        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 - 1; k++)
		f[i][j] = min(f[i][j], f[i][k] + f[k + 1][j] + s[j] - s[i - 1]);
	}
    cout << f[1][n] << endl;
    return 0;
}