#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
struct cplx {
  ll x, y, z;
  cplx(ll x = 0, ll y = 0, ll z = 0) : x(x), y(y), z(z) {}
};
ll det(cplx a, cplx b) { return a.x * b.y - a.y * b.x; }
cplx operator+(cplx a, cplx b) {
  return {a.x + b.x, a.y + b.y, a.z + b.z + a.x * b.y};
}
struct node {
  array<node *, 2> ch;
  cplx val, sum;
  int rank;
  node(cplx val) : val(val) {
    ch[0] = ch[1] = NULL;
    sum = val;
    rank = rand();
  }
  void update() {
    sum = val;
    if (ch[0]) sum = ch[0]->sum + sum;
    if (ch[1]) sum = sum + ch[1]->sum;
  }
};
bool operator<(cplx a, cplx b) {
  auto d = det(a, b);
  if (d) return d < 0;
  if (a.x != b.x) return a.x < b.x;
  if (a.y != b.y) return a.y < b.y;
  if (a.z != b.z) return a.z < b.z;
  return false;
}
void rotate(node *&u, int c) {
  auto v = u->ch[c];
  u->ch[c] = v->ch[!c];
  v->ch[!c] = u;
  u->update();
  v->update();
  u = v;
}
node *insert(node *rt, cplx val) {
  if (!rt) return new node(val);
  auto c = rt->val < val;
  rt->ch[c] = insert(rt->ch[c], val);
  if (rt->ch[c]->rank < rt->rank) rotate(rt, c);
  rt->update();
  return rt;
}
void erase(node *&rt, cplx val) {
  if (val < rt->val) {
    erase(rt->ch[0], val);
    rt->update();
    return;
  }
  if (rt->val < val) {
    erase(rt->ch[1], val);
    rt->update();
    return;
  }
  auto tmp = rt;
  if (rt->ch[0]) {
    if (rt->ch[1]) {
      auto c = rt->ch[0]->rank > rt->ch[1]->rank;
      rotate(rt, c);
      erase(rt->ch[!c], val);
      rt->update();
    } else {
      rt = rt->ch[0];
      delete tmp;
    }
  } else {
    if (rt->ch[1]) {
      rt = rt->ch[1];
      delete tmp;
    } else {
      rt = NULL;
      delete tmp;
    }
  }
}
int main() {
  // ios::sync_with_stdio(false);
  // cin.tie(0);
  int n;
  cin >> n;
  vector<ll> a(n);
  for (auto &v : a) cin >> v;
  vector<cplx> r = {};
  vector<vector<cplx>> pop(n);
  for (int i = n - 1; i >= 0; i--) {
    auto v = cplx{1ll, a[i], a[i]};
    while (r.size() && det(r.back(), v) >= 0) {
      v = r.back() + v;
      pop[i].push_back(r.back()), r.pop_back();
    }
    r.push_back(v);
  }
  node *rt = NULL;
  for (auto v : r) rt = insert(rt, v);
  vector<cplx> l;
  for (int i = 0; i < n; i++) {
    erase(rt, r.back()), r.pop_back();
    auto &arr = pop[i];
    while (arr.size()) {
      auto v = arr.back();
      rt = insert(rt, v), r.push_back(v);
      arr.pop_back();
    }
    cout << rt->sum.z + a[i] * (n - 1) << ' ';
    auto v = cplx{1ll, a[i], a[i]};
    while (l.size() && det(l.back(), v) >= 0) {
      v = l.back() + v;
      erase(rt, l.back()), l.pop_back();
    }
    l.push_back(v), rt = insert(rt, v);
  }
  cout << endl;
  return 0;
}