#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const long long inf = 1LL << 60;
int main() {
	int N;
	cin >> N;
	vector<long long> A(N);
	for (int i = 0; i < N; ++i) {
		cin >> A[i];
	}
	vector<long long> S(N + 1);
	for (int i = 0; i < N; ++i) {
		S[i + 1] = S[i] + A[i];
	}
	vector<long long> dp(N + 1, inf);
	dp[0] = 0;
	vector<long long> ans(N + 1, inf);
	for (int i = N; i >= 1; --i) {
		for (int j = 0; j <= N; ++j) {
			ans[i] = min(ans[i], dp[j] + (S[N] - S[j]) * (S[N] - S[j]));
		}
		vector<long long> ndp(N + 1, inf);
		for (int j = 0; j <= N; ++j) {
			for (int k = j - 1; k >= 0; --k) {
				ndp[j] = min(ndp[j], dp[k] + (S[j - 1] - S[k]) * (S[j - 1] - S[k]));
			}
		}
		dp = ndp;
	}
	for (int i = 1; i <= N; ++i) {
		cout << ans[i] << '\n';
	}
	return 0;
}