#include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> A(3100),R(3100);
ll w(ll i,ll j){
    // ドア i と ドア j を開ける場合
    // 0 -> N + 1 が最大
    ll r = R[j - 1] - R[i];
    return r * r;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    for(ll i = 0;i < N;i++){
        cin >> A[i];
        R[i + 1] = R[i] + A[i];
    }
    vector<vector<ll>> DP(N + 2,vector<ll>(N + 2,1e18)),DP2 = DP; // i辺使った, 今 j にいる
    for(ll i = 1;i <= N + 1;i++){
        DP[i][i] = 0;
        DP2[i][i] = i - 1;
        DP[1][i] = w(0,i);
    }
    for(ll d = 1;d <= N;d++){
        for(ll i = 2;i + d <= N + 1;i++){
            ll j = i + d;
            ll p = DP2[i][j - 1],q = DP2[i + 1][j];
            for(ll k = p;k <= q;k++){
                if(DP[i][j] > DP[i - 1][k] + w(k,j)){
                    DP[i][j] = DP[i - 1][k] + w(k,j);
                    DP2[i][j] = k;
                }
            }
        }
    }
    for(ll i = N;i >= 1;i--){
        cout << DP[i][N + 1] << endl;
    }
}