#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

set<pll> se;

void mainmain(){
	int n;
	cin>>n;
	vll v(n);
	ll S = 0;
	rep(i,n) cin>>v[i];
	rep(i,n){
		S += v[i];
	}

	ll h = 0;
	vll ans(n);
	vll hh(n,-1);
	vll q(n);
	rep(i,n){
		if(v[i]>h){
			hh[i] = h;
			h = v[i];
		}
	}
	for(int i = n-1; i>=0; i--){
		if(hh[i]>=0){
			pll t(hh[i],0);
			// cout<<i<<" "<<hh[i]<<endl;
			while(1){
				auto it = se.lower_bound(pll(hh[i],INFL));
				if(it==se.end()) break;
				pll tmp = *it;
				// cout<<"tmp "<<tmp.F<<" "<<tmp.S<<endl;
				se.erase(it);
				t.S += tmp.S;
				q[i] += (tmp.F - hh[i])*tmp.S;
			}
			q[i] += v[i] - hh[i];
			t.S++;
			// cout<<"t "<<t.F<<" "<<t.S<<endl;
			auto it = se.lower_bound(pll(t.F, -1));
			if(it == se.end()){
				se.insert(t);
			}
			else if(it->F != t.F){
				se.insert(t);
			}
			else{
				pll tmp = *it;
				se.erase(it);
				t.S += tmp.S;
				se.insert(t);
			}
		}
		else{
			auto it = se.lower_bound(pll(v[i], 0));
			if(it==se.end()){
				se.insert(pll(v[i], 1));
			}
			else if(it->F != v[i]){
				se.insert(pll(v[i], 1));
			}
			else{
				pll tmp = *it;
				se.erase(it);
				tmp.S++;
				se.insert(tmp);
			}
		}
	}
	h = 0;
	rep(i,n){
		if(v[i]>h){
			ll t = q[i];
			ans[i] += t;
			S -= t;
			h = v[i];
		}
	}
	// assert(S==0);
	rep(i,n){
		cout<<ans[i]<<endl;
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 9856