#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include <random>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
#define newline puts("")
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

// coordinate compression
struct X {
  typedef int T;
  vector<T> d;
  inline void add(T x) { d.pb(-x);}
  void init() {
    sort(rng(d));
    d.erase(unique(rng(d)), d.end());
  }
  inline int size() { return sz(d);}
  inline int operator[](T x) { return upper_bound(rng(d),-x)-d.begin()-1;}
};
//

// Binary Indexed Tree
struct bit {
  typedef ll TT;
  int n; vector<TT> d;
  vi e;
  bit() {}
  bit(int mx): n(mx), d(mx), e(mx) {}
  void add(int i, TT x=1) {
    for (++i;i<n;i+=i&-i) d[i] += x, ++e[i];
  }
  int y;
  TT sum(int i) {
    TT x = 0; y = 0;
    for (++i;i;i-=i&-i) x += d[i], y += e[i];
    return x;
  }
};
//


int main() {
  int n;
  scanf("%d",&n);
  vi a(n+1);
  rep(i,n) scanf("%d",&a[i+1]);
  X xs;
  rep(i,n+1) xs.add(a[i]);
  xs.init();
  vi is(1);
  rrep(i,n) {
    if (a[i] <= a[is.back()]) continue;
    is.pb(i);
  }
  vl ans(n);
  int r = n;
  bit d(sz(xs)+2);
  ll s = 0;
  while (sz(is) > 1) {
    int i = is.back(); is.pop_back();
    while (r >= i) {
      d.add(xs[a[r]],a[r]);
      --r;
    }
    int j = is.back();
    ll now = 0;
    now = d.sum(xs[a[j]]);
    now -= s;
    now -= (ll)a[j]*d.y;
    s += now;
    ans[i-1] = now;
  }
  for (ll x : ans) printf("%lld\n",x);
  return 0;
}






















Measured memory_bytes: 4344