#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


// ((nu, de), (cost, id))
using Slope = pair<pair<Int, Int>, pair<Int, int>>;

// weight: ..., 2, 1
struct Node {
  Int sz, sum0, sum1;
  Node() : sz(0), sum0(0), sum1(0) {}
  Node(const Slope &f) : sz(f.first.second), sum0(f.first.first), sum1(f.second.first) {}
  void pull(const Node &l, const Node &r) {
    sz = l.sz + r.sz;
    sum0 = l.sum0 + r.sum0;
    sum1 = l.sum1 + l.sum0 * r.sz + r.sum1;
  }
};


int N;
vector<Int> A;

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    vector<Slope> fs;
    // i-1 -> i
    vector<vector<int>> addss(N + 1), remss(N + 1);
    
    // to the left
    {
      int len = 0;
      vector<Slope> stack(N);
      for (int i = 0; i < N; ++i) {
        Int p = A[i];
        Int q = 1;
        for (; len >= 1; ) {
          const Int pp = stack[len - 1].first.first;
          const Int qq = stack[len - 1].first.second;
          if (p * qq >= pp * q) {
            remss[i + 1].push_back(stack[len - 1].second.second);
            p += pp;
            q += qq;
            --len;
          } else {
            break;
          }
        }
        Int cost = 0, now = 0;
        for (int di = 0; di < q; ++di) {
          cost += now += A[i - di];
        }
        const int id = fs.size();
        fs.emplace_back(make_pair(p, q), make_pair(cost, id));
        addss[i + 1].push_back(id);
        stack[len++] = fs.back();
      }
    }
    
    // to the right
    {
      int len = 0;
      vector<Slope> stack(N);
      for (int i = N; --i > 0; ) {
        Int p = A[i];
        Int q = 1;
        for (; len >= 1; ) {
          const Int pp = stack[len - 1].first.first;
          const Int qq = stack[len - 1].first.second;
          if (p * qq >= pp * q) {
            addss[i].push_back(stack[len - 1].second.second);
            p += pp;
            q += qq;
            --len;
          } else {
            break;
          }
        }
        Int cost = 0, now = 0;
        for (int di = 0; di < q; ++di) {
          cost += now += A[i + di];
        }
        const int id = fs.size();
        fs.emplace_back(make_pair(p, q), make_pair(cost, id));
        remss[i].push_back(id);
        stack[len++] = fs.back();
      }
      for (; len >= 1; ) {
        addss[0].push_back(stack[--len].second.second);
      }
    }
    
    sort(fs.begin(), fs.end(), [&](const Slope &f0, const Slope &f1) -> bool {
      const Int p0 = f0.first.first;
      const Int q0 = f0.first.second;
      const Int p1 = f1.first.first;
      const Int q1 = f1.first.second;
      return (p0 * q1 < p1 * q0);
    });
    const int fsLen = fs.size();
// cerr<<"fs = "<<fs<<endl;
// cerr<<"addss = "<<addss<<endl;
// cerr<<"remss = "<<remss<<endl;
    
    vector<int> poss(fsLen);
    for (int k = 0; k < fsLen; ++k) {
      poss[fs[k].second.second] = k;
    }
    
    vector<Int> ans(N);
    SegmentTreePoint<Node> seg(fsLen);
    for (int i = 0; i < N; ++i) {
      for (const int j : addss[i]) {
        const int k = poss[j];
// cerr<<"add "<<fs[k]<<endl;
        seg.change(k, fs[k]);
      }
      for (const int j : remss[i]) {
        const int k = poss[j];
// cerr<<"rem "<<fs[k]<<endl;
        seg.change(k, Node());
      }
// cerr<<"  sz = "<<seg.ts[1].sz<<", sum0 = "<<seg.ts[1].sum0<<", sum1 = "<<seg.ts[1].sum1<<endl;
      ans[i] = seg.ts[1].sum1;
      ans[i] += (N - 1) * A[i];
    }
    
    for (int i = 0; i < N; ++i) {
      if (i) printf(" ");
      printf("%lld", ans[i]);
    }
    puts("");
  }
  return 0;
}