#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;
int a[200005];
ll ssum;

bool cmp(pll s,pll t){//s 放在前面,好吗
	return s.second * t.first >= t.second * s.first;
}
vector <pll> sta,res;
ll ans;
void emplace(int i){
	sta.eb(mkp(a[i],1));
	pll temp;
	while(SZ(sta) >= 2 && cmp(sta[SZ(sta) - 2],sta.back())){
		ans += sta.back().second * sta[SZ(sta) - 2].first;
		temp = sta.back();
		sta.pop_back();
		sta[SZ(sta) - 1].first += temp.first;
		sta[SZ(sta) - 1].second += temp.second;
	}
}

void solve(int k){
	ans = 0;
	sta.clear();
	rep(i,1,k - 1) emplace(i);
	swap(res,sta);
	per(i,n,k + 1) emplace(i);

	while(!res.empty()){
		sta.eb(res.back());
		res.pop_back();
	}
	sort(sta.begin(),sta.end(),cmp);
	ll sum = 1;
	for(pll I:sta){
		ans += I.first * sum;
		sum += I.second;
	}
	printf("%lld ",n * ssum - ans - a[k]);
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%d",&a[i]);
		ssum += a[i];
	}
	rep(k,1,n) solve(k);
	printf("\n");
	return 0;
}