#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
const int N = 2e5 + 5;
int n, m, a[N], sz;
pll s[N], all[N << 1];
ll t[N], add[N];
vector<pll> ins[N], del[N];

inline bool cmp(const pll &x, const pll &y) {
	return x.first * y.second < y.first * x.second;
}

inline pll operator + (const pll &x, const pll &y) {
	return pll(x.first + y.first, x.second + y.second);
}

struct BIT {
	ll s[N << 1];
	inline void add(int x, ll v) {
		for (; x <= m; x += x & -x) s[x] += v;
	}
	inline ll sum(int x) {
		ll res = 0;
		for (; x; x &= x - 1) res += s[x];
		return res;
	}
} TS, TL;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	ll ans = 0;
	for (int i = 1; i <= n; ++i) cin >> a[i], ans += a[i];
	for (int i = 1; i <= n; ++i) {
		pll cur(a[i], 1);
		ll sb = 0;
		while (sz && cmp(s[sz], cur)) {
			sb += t[sz] + s[sz].second * cur.first;
			cur = cur + s[sz];
			del[i + 1].emplace_back(s[sz]);
			add[i + 1] -= t[sz--];
		}
		all[++m] = s[++sz] = cur;
		t[sz] = sb;
		add[i + 1] += sb;
		ins[i + 1].emplace_back(cur);
	}
	sz = 0;
	for (int i = n; i >= 1; --i) {
		pll cur(a[i], 1);
		ll sb = 0;
		while (sz && cmp(s[sz], cur)) {
			sb += t[sz] + s[sz].second * cur.first;
			cur = cur + s[sz];
			ins[i].emplace_back(s[sz]);
			add[i] += t[sz--];
		}
		all[++m] = s[++sz] = cur;
		t[sz] = sb;
		del[i].emplace_back(cur);
		add[i] -= sb;
	}
	for (int i = 1; i <= sz; ++i) ins[1].emplace_back(s[i]), add[1] += t[i];
	sort(all + 1, all + m + 1, cmp);
	for (int i = 1; i <= n; ++i) {
		for (auto pr : del[i]) {
			int p = lower_bound(all + 1, all + m + 1, pr, cmp) - all;
			TS.add(p, -pr.first), TL.add(p, -pr.second);
			ans -= pr.second * TS.sum(p) + pr.first * (TL.sum(m) - TL.sum(p));
		}
		for (auto pr : ins[i]) {
			int p = lower_bound(all + 1, all + m + 1, pr, cmp) - all;
			ans += pr.second * TS.sum(p) + pr.first * (TL.sum(m) - TL.sum(p));
			TS.add(p, pr.first), TL.add(p, pr.second);
		}
		ans += add[i];
		cout << ans + (n - 2) * a[i] << ' ';
	}
	cout << '\n';
	return 0;
}