#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

std::vector<int> a;
std::vector<int64_t> sum;
int64_t cost(int l, int r) {
	return (sum[r - 1] - sum[l]) * (sum[r - 1] - sum[l]);
}

std::vector<std::vector<int64_t> > dp;
void monotone_minima(int k, int l, int r, int prev_l, int prev_r) {
	int m = l + ((r - l) >> 1);
	int64_t min = 1000000000000000000;
	int mindex = -1;
	for (int i = prev_l; i <= std::min(m - 1, prev_r); i++) {
		if (min > dp[k - 1][i] + cost(i, m)) {
			min = dp[k - 1][i] + cost(i, m);
			mindex = i;
		}
	}
	assert(mindex != -1);
	dp[k][m] = std::min(dp[k][m], min);
	if (l < m) monotone_minima(k, l, m - 1, prev_l, mindex);
	if (m < r) monotone_minima(k, m + 1, r, mindex, prev_r);
}


int main() {
	int n = ri();
	a.resize(n);
	for (auto &i : a) i = ri();
	sum.resize(n + 1);
	for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + a[i];
	
	dp.resize(n + 1, std::vector<int64_t> (n + 2, 1000000000000000000));
	dp[0][0] = 0;
	for (int i = 1; i <= n; i++) monotone_minima(i, i, n + 1, 0, n + 1);
	
	for (int i = n; i; i--) printf("%lld\n", (long long) dp[i][n + 1]);
	return 0;
}