#include <deque>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const long long inf = 1LL << 62;
class linear {
public:
	long long a, b;
	linear() : a(0), b(0) {};
	linear(long long a_, long long b_) : a(a_), b(b_) {};
	long long get(long long x) const {
		return a * x + b;
	}
	double collide(const linear& l) const {
		return -double(a - l.a) / (b - l.b);
	}
};
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[N] - 2 * S[j]));
		}
		deque<linear> que;
		vector<long long> ndp(N + 1, inf);
		for (int j = 1; j <= N; ++j) {
			linear ln(-2 * S[j - 1], dp[j - 1]);
			while (que.size() >= 2 && que[que.size() - 2].collide(ln) < que[que.size() - 1].collide(ln)) {
				que.pop_back();
			}
			que.push_back(ln);
			while (que.size() >= 2 && que[0].get(S[j - 1]) > que[1].get(S[j - 1])) {
				que.pop_front();
			}
			ndp[j] = que.front().get(S[j - 1]) + S[j - 1] * S[j - 1] + S[j] * S[j];
		}
		dp = ndp;
	}
	for (int i = 1; i <= N; ++i) {
		cout << ans[i] << '\n';
	}
	return 0;
}