#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;

static const int INTINF = (2147483647 >> 1); // 10^9 + 5000
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 1e5+1;
static const ll MOD = 1e9+7;

namespace Kunitaka{
    template<
        typename TYPE,
        std::size_t SIZE
    >
    std::size_t array_length(const TYPE (&array)[SIZE])
    {
        return SIZE;
    }

    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
}
using namespace Kunitaka;
namespace Printer{
    void br(){
        cout << endl;
    }

    void loop_cnt(int i){
        cout << "i = " << i << endl;
    }

    void loop_cnt(int i, int j){
        cout << "i = " << i << ", " << "j = " << j << endl;
    }

    template<class T>
    void print(T x){
        cout << x << endl;
    }

    template<class T, class S>
    void print(T x, S y){
        cout << x << "," << y << endl;
    }

    template<class T, class S, class U>
    void print(T x, S y, U z){
        cout << x << "," << y << "," << z << endl;
    }

    template<class T, class S>
    void print(pair<T, S> p){
        cout << p.first << ", " << p.second << endl;
    }

    template<
        typename TYPE,
        std::size_t SIZE
    >
    void print(const TYPE (&array)[SIZE]){
        int lim = array_length(array);
        for(int i=0; i<lim; i++){
            if(i) cout << " ";
            cout << array[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<S> v){
        for(int i=0; i<v.size(); i++){
            if(i) cout << " ";
            cout<< v[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<vector<S> > vv){
        for(int i=0; i<vv.size(); i++){
            for(int j=0; j<vv[i].size(); j++){
                if(j) cout << " ";
                cout << vv[i][j];
            }
            cout << endl;
        }
    }

    void yesno(bool x){
        if(x) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
};
using namespace Printer;

ll N;
vector<ll> v;
ll sum[410][410];
ll memo[410][410];

// [l, r)
ll solve(int l, int r){
    if(memo[l][r] >= 0) {
        return memo[l][r];
    }

    ll res = LLINF;

    rep2(i, l+1, r){
        res = min(res, solve(l, i) + solve(i, r) + sum[l][i] + sum[i][r]);
    }

    return memo[l][r] = res;
}

int main(int argc, const char * argv[]) {
    //提出時、消す----//
    //--------------//


    // input
    cout << fixed << setprecision(10);
    cin >> N;
    memset(memo, -1, sizeof(memo));
    memset(sum, 0, sizeof(sum));
    v.resize(N);
    rep(i, N){
        cin >> v[i];
        sum[0][i+1] = sum[0][i] + v[i];
        memo[i][i+1] = 0;
    }
    rep2(i, 1, N){
        rep2(j, i+1, N+2){
            sum[i][j-1] = sum[0][j-1] - sum[0][i];
        }
    }

    // rep(i, N+1){
    //     rep(j, N+1){
    //         if(j) cout << " ";
    //         cout << sum[i][j];
    //     }
    //     cout << endl;
    // }
    
    // return 0;

    ll ans = solve(0, N);

    // rep(i, N+1){
    //     rep(j, N+1){
    //         if(j) cout << " ";
    //         cout << memo[i][j];
    //     }
    //     cout << endl;
    // }

    

    print(ans);
    
    return 0;
}


Measured memory_bytes: 2944