#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 1e18 + 100;
ll N;
vector<ll> R = {0};
inline ll f(ll i,ll j){
    return (R[j - 1] - R[i]) * (R[j - 1] - R[i]);
}
int main(){
    ll N;
    cin >> N;
    for(ll i = 0;i < N;i++){
        ll a;
        cin >> a;
        R.emplace_back(R.back() + a);
    }
    vector<vector<ll>> DP(N + 2,vector<ll>(N + 2,MAX)),idx(N + 2,vector<ll>(N + 2));
    ll a = 0;
    DP[0][0] = 0;
    idx[0][0] = 0;
    for(ll i = 1;i <= N + 1;i++){
        a += f(i - 1,i);
        DP[i][i] = a;
        idx[i][i] = i - 1;
    }
    for(ll d = 1;d <= N;d++){
        for(ll i = d + 1;i <= N + 1;i++){
            // cerr << i - d << "," << i << " " << idx[i - d][i - 1] << "~" << idx[i - d + 1][i] << endl;

            for(ll k = idx[i - d][i - 1];k <= idx[i - d + 1][i];k++){
                if(DP[i - d][i] > DP[i - d - 1][k] + f(k,i)){
                    DP[i - d][i] = DP[i - d - 1][k] + f(k,i);
                    idx[i - d][i] = k;
                }
            }
            // cerr << i - d << "," << i << " = " << DP[i - d][i] << endl;

        }
    }
    for(ll i = 0;i < N;i++){
        cout << DP[N - i][N + 1] << endl;
    }
}