#include<bits/stdc++.h>
using namespace std;
#define i64 __int128
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define lowbit(i) i&(-i)
const int N = 3e5+5;
int n,p[N],fa[N],l[N],r[N],maxx[N][20],pos[N][20];
ll xs[N],ans[N],siz[N],dep[N];
ll val[N*4];
stack<int> stk;
vector<int> e[N];
int ask(int l,int r){
    int k = log2(r-l+1);
    if(maxx[l][k]>maxx[r-(1<<k)+1][k]) return pos[l][k];
    else return pos[r-(1<<k)+1][k];
}
void update(int l,int r,int u,int sl,int sr,ll w){
    if(l>sr || sl>r) return ;
    if(sl<=l && r<=sr){
        val[u] += w;
        return ;
    }
    int mid = (l+r)>>1;
    update(l,mid,u*2,sl,sr,w);
    update(mid+1,r,u*2+1,sl,sr,w);
}
ll ask(int l,int r,int u,int p){
    if(l==r) return val[u];
    ll res = val[u];
    int mid = (l+r)>>1;
    if(p<=mid) res += ask(l,mid,u*2,p);
    else res += ask(mid+1,r,u*2+1,p);
    return res;
}
void dfs(int u){
    siz[u] = 1,xs[u] += dep[u];
    for(int v:e[u]){
        dep[v] = dep[u]+1;
        dfs(v);
        xs[u] += xs[v];
        siz[u] += siz[v];
    }
    update(1,n,1,l[u],u-1,1);
    update(1,n,1,u+1,r[u],1);
    if(fa[u]!=u){
        int l1=l[fa[u]],r1=l[u]-1,l2=r[u]+1,r2=r[fa[u]];
        ll w = xs[u]-1ll*dep[fa[u]]*siz[u]+siz[u];
        // cout << l1 << ' ' << r1 << ' ' << l2 << ' ' << r2 << " " << w << '\n';  
        update(1,n,1,l1,r1,w);
        update(1,n,1,l2,r2,w);
    }
}
int main(){
    cin.tie(0),cout.tie(0);
    ios::sync_with_stdio(0);
    cin >> n;
    for(int i=1;i<=n;i++) cin >> p[i],maxx[i][0] = p[i],pos[i][0] = i;
    for(int i=1;i<=n;i++){
        l[i] = 1,r[i] = n;
        while(stk.size() && p[stk.top()]<p[i]) r[stk.top()] = i,stk.pop();
        if(stk.size()) l[i] = stk.top();
        stk.push(i);
    }
    for(int i=1;i<=19;i++){
        for(int j=1;j+(1<<(i-1))<=n;j++){
        //     minn[j][i] = min(minn[j][i-1],minn[j+(1<<(i-1))][i-1]);
            if(maxx[j][i-1]>maxx[j+(1<<(i-1))][i-1]) maxx[j][i] = maxx[j][i-1],pos[j][i] = pos[j][i-1];
            else maxx[j][i] = maxx[j+(1<<(i-1))][i-1],pos[j][i] = pos[j+(1<<(i-1))][i-1];
        }
    }
    for(int i=1;i<=n;i++) fa[i] = ask(l[i],r[i]);
    for(int i=1;i<=n;i++) if(fa[i]!=i) e[fa[i]].pb(i);
    for(int i=1;i<=n;i++) if(fa[i]==i) dfs(i);
    for(int i=1;i<=n;i++) cout << ask(1,n,1,i) << " ";
    return 0;
}