#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
#define eb emplace_back
using ll=long long;
using PL=pair<ll,int>;
using P=pair<int,int>;
#define tct template<class t>
#define tctu template<class t,class u>
tct using vc=vector<t>;
tctu bool chmax(t&a,u b){if(a<b){a=b;return 1;}return 0;}
tctu bool chmin(t&a,u b){if(a>b){a=b;return 1;}return 0;}

const int ALP=26;
void solve(){
	int n;
	cin>>n;
	vc<int> A(n);
	for(int i=0;i<n;i++){
		cin>>A[i];
		A[i]--;
	}
	vc<ll> ans(n);
	vc<ll> L1(n),L2(n);
	stack<int> st;
	for(int i=0;i<n;i++){
		while(!st.empty()&&A[st.top()]<A[i]){
			L2[i]+=L2[st.top()];
			st.pop();
		}
		int l=-1;
		if(!st.empty()){
			l=st.top();
			L1[i]+=L1[l];
		}
		L1[i]+=L2[i];
		ans[i]+=L1[i];
		L1[i]+=i-l;
		L2[i]+=i-l;
		st.push(i);
		//printf("%d %d : %d\n",L1[i],L2[i],ans[i]);
	}
	while(!st.empty()) st.pop();
	vc<ll> R1(n),R2(n);
	for(int i=n-1;i>=0;i--){
		while(!st.empty()&&A[st.top()]<A[i]){
			R2[i]+=R2[st.top()];
			st.pop();
		}
		int r=n;
		if(!st.empty()){
			r=st.top();
			R1[i]+=R1[r];
		}
		R1[i]+=R2[i];
		ans[i]+=R1[i];
		R1[i]+=r-i;
		R2[i]+=r-i;
		st.push(i);
	}
	for(int i=0;i<n;i++) cout<<ans[i]<<" ";
	cout<<endl;
}
	
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int T=1;
	while(T--) solve();
}