#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 2e5 + 5;
int n;

struct info {
    int c0, c1, cans;
    info() : c0(0), c1(0), cans(0) {}
    info(int c0, int c1) : c0(c0), c1(c1), cans() {}
    info(int c0, int c1, int cans) : c0(c0), c1(c1), cans(cans) {}
    friend info operator + (const info &p1, const info &p2) {
        return info(p1.c0 + p2.c0, p1.c1 + p2.c1, p1.cans + p2.cans + 1LL * p1.c1 * p2.c0);
    }
} segm[N * 8];

using P = pair<info, int>;

void upd (int l, int r, int idx, int pos, info val) {
    if (l == r) return void(segm[idx] = val);
    int mid = (l + r) >> 1;
    if (pos <= mid) upd(l, mid, idx * 2 + 1, pos, val);
    else upd(mid + 1, r, idx * 2 + 2, pos, val);
    segm[idx] = segm[idx * 2 + 1] + segm[idx * 2 + 2];
}

bool cmp (const info &p1, const info &p2) {
    return 1LL * p1.c0 * p2.c1 > 1LL * p2.c0 * p1.c1;
}

int main() {
    scanf("%d", &n);
    vector<int> a(n);
    ll sum = 0;
    for (auto &e: a) scanf("%d", &e), sum += e;
    vector<info> va, vb;
    vector<int> va2, vb2;
    vector<vector<int>> adda(n, vector<int>()), dela(n, vector<int>());
    vector<vector<int>> addb(n, vector<int>()), delb(n, vector<int>());
    vector<P> c;
    int idx = 0;
    for (int i = 0; i < n; i++) {
        info cur = info(a[i], 1);
        while (!va.empty() && cmp(cur, va.back())) {
            auto x = va.back(); va.pop_back();
            dela[i].emplace_back(va2.back()); va2.pop_back();
            cur = x + cur;
        }
        va.emplace_back(cur);
        c.emplace_back(cur, idx);
        adda[i].emplace_back(idx);
        va2.emplace_back(idx++);
    }
    for (int i = n - 1; i >= 0; i--) {
        info cur = info(a[i], 1);
        while (!vb.empty() && cmp(cur, vb.back())) {
            auto x = vb.back(); vb.pop_back();
            delb[i].emplace_back(vb2.back()); vb2.pop_back();
            cur = x + cur;
        }
        vb.emplace_back(cur);
        c.emplace_back(cur, idx);
        addb[i].emplace_back(idx);
        vb2.emplace_back(idx++);
    }
    sort(c.begin(), c.end(), [&] (const P &p1, const P &p2) {
        return cmp(p1.first, p2.first);
    });
    int csz = c.size();
    vector<int> cc(csz);
    for (int i = 0; i < csz; i++) cc[c[i].second] = i;
    for (auto &e: vb2) upd(0, csz - 1, 0, cc[e], c[cc[e]].first);
    vector<ll> ans(n);
    for (int i = 0; i < n; i++) {
        for (auto &e: addb[i]) upd(0, csz - 1, 0, cc[e], info());
        for (auto &e: delb[i]) upd(0, csz - 1, 0, cc[e], c[cc[e]].first);
        ans[i] = segm[0].cans;
        for (auto &e: dela[i]) upd(0, csz - 1, 0, cc[e], info());
        for (auto &e: adda[i]) upd(0, csz - 1, 0, cc[e], c[cc[e]].first);
    }
    for (int i = 0; i < n; i++) printf("%lld ", ans[i] + sum + 1LL * a[i] * (n - 2));
}