// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) {rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1];}

const int N = 3e5;
int a, s[N + 5], ls[N + 5], rs[N + 5], fa[N + 5], rt, p[N + 5], L[N + 5], R[N + 5],
	ans[N + 5], l[N + 5], r[N + 5];

void dfs(int n) {
	if(ls[n]) dfs(ls[n]), l[n] = l[ls[n]];
	else l[n] = n;
	if(rs[n]) dfs(rs[n]), r[n] = r[rs[n]];
	else r[n] = n;
}
void Dfs(int n) {
	if(ls[n]) Dfs(ls[n]);
	if(rs[n]) Dfs(rs[n]);
	L[n] = 1 + L[rs[n]] + r[n] - n + L[ls[n]];
	R[n] = 1 + R[ls[n]] + n - l[n] + R[rs[n]];
	ans[n] = L[rs[n]] + R[ls[n]];
}
void calc(int n, int w) {
	ans[n] += w;
	if(ls[n]) calc(ls[n], w + 1 + L[rs[n]] + r[n] - n);
	if(rs[n]) calc(rs[n], w + 1 + R[ls[n]] + n - l[n]);
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a;
	rep(i, 1, a) {
		cin >> s[i];
		int now = i - 1;
		while(now && s[now] < s[i]) now = fa[now];
		if(!now) ls[i] = rt, fa[rt] = i, rt = i;
		else {
			ls[i] = rs[now];
			fa[rs[now]] = i;
			rs[now] = i;
			fa[i] = now;
		}
	}
	dfs(rt);
	Dfs(rt);
	// cout << L[5] << endl;
	calc(rt, 0);
	rep(i, 1, a) cout << ans[i] << ' ';
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}