#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m;
int a[200005];
pll P[800005];
ll ssum;

bool cmp(pll s,pll t){//s 放在前面,好吗
	return s.second * t.first >= t.second * s.first;
}

vector <int> SS[200005][2];
vector <int> sta;
ll ans;
ll _ans[200005][2];
void emplace(int i,int op){
	P[++m] = mkp(a[i],1);
	sta.eb(m);
	SS[i][op].eb(m);
	int px,py;
	while(SZ(sta) >= 2 && cmp(P[sta[SZ(sta) - 2]],P[sta.back()])){
		py = sta.back();
		sta.pop_back();
		px = sta.back();
		sta.pop_back();

		ans += P[py].second * P[px].first;
		P[++m] = mkp(P[px].first + P[py].first,P[px].second + P[py].second);
		sta.eb(m);
		SS[i][op].eb(-px);SS[i][op].eb(-py);SS[i][op].eb(m);
	}
}

int ord[800005],rk[800005];
bool cmp2(int x,int y){
	return cmp(P[x],P[y]);
}

struct node{
	ll ans,sums,suma;
}tree[3200005];
#define ls (rt * 2)
#define rs (rt * 2 + 1)
int b[800005];
void pushup(int rt){
	tree[rt].ans = tree[ls].ans + tree[rs].ans + tree[ls].sums * tree[rs].suma;
	tree[rt].sums = tree[ls].sums + tree[rs].sums;
	tree[rt].suma = tree[ls].suma + tree[rs].suma;
}

void build(int rt,int l,int r){
	if(l == r){
		if(!b[ord[l]]){
			tree[rt].sums = tree[rt].suma = 0;
		}else{
			tree[rt].sums = P[ord[l]].second;
			tree[rt].suma = P[ord[l]].first;			
		}
		return;
	}
	int mid = (l + r) >> 1;
	build(ls,l,mid);build(rs,mid+1,r);
	pushup(rt);
}

void modify(int rt,int l,int r,int pos){
	if(l == r){
		if(!b[ord[l]]){
			tree[rt].sums = tree[rt].suma = 0;
		}else{
			tree[rt].sums = P[ord[l]].second;
			tree[rt].suma = P[ord[l]].first;			
		}
		return;		
	}
	int mid = (l + r) >> 1;
	if(pos <= mid) modify(ls,l,mid,pos);
	else modify(rs,mid+1,r,pos);
	pushup(rt);
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%d",&a[i]);
		ssum += a[i];
	}
	rep(i,1,n){
		emplace(i,0);
		_ans[i][0] = ans;
	}

	ans = 0;
	sta.clear();
	per(i,n,2){
		emplace(i,1);
		_ans[i][1] = ans;
	}

/*	rep(i,1,m) printf("pair %d (%lld,%lld)\n",i,P[i].first,P[i].second);
	printf("\n");
	printf("Left to Right:\n");
	rep(i,1,n){
		printf("i=%d:",i);
		for(int id:SS[i][0]) printf("%d ",id);
		printf("\n");
	}
	printf("Right to Left:\n");
	per(i,n,1){
		printf("i=%d:",i);
		for(int id:SS[i][1]) printf("%d ",id);
		printf("\n");		
	}*/

	rep(i,1,m) ord[i] = i;
	sort(ord + 1,ord + m + 1,cmp2);
	rep(i,1,m) rk[ord[i]] = i;
	for(int id:sta) b[id] = 1;
	build(1,1,m);

	rep(k,1,n){
		printf("%lld ",ssum * (n - 1) - _ans[k - 1][0] - _ans[k + 1][1] - tree[1].ans);

		for(int id:SS[k][0]){
			if(id < 0){
				b[-id] = 0;
				modify(1,1,m,rk[-id]);
			}else{
				b[id] = 1;
				modify(1,1,m,rk[id]);
			}
		}
		reverse(SS[k + 1][1].begin(),SS[k + 1][1].end());
		for(int id:SS[k + 1][1]){
			if(id < 0){
				b[-id] = 1;
				modify(1,1,m,rk[-id]);
			}else{
				b[id] = 0;
				modify(1,1,m,rk[id]);
			}			
		}

//		printf("k=%d\n",k);
//		rep(i,1,m) printf("%d",b[i]);
//		printf("\n");
	}
	return 0;
}