#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int p[300010];
int rt, son[300010][2];
int ST[300010][20], lg2[300010];
int pmax(int a, int b) {
    return p[a] > p[b] ? a : b;
}
void buildST() {
    lg2[0] = -1;
    for (int i = 1; i <= n; i++) lg2[i] = lg2[i >> 1] + 1;
    for (int i = n; i > 0; i--) {
        ST[i][0] = i;
        for (int j = 1; i + (1 << j) - 1 <= n; j++)
            ST[i][j] = pmax(ST[i][j - 1], ST[i + (1 << j - 1)][j - 1]);
    }
}
int calc(int a, int b) {
    int k = lg2[b - a + 1];
    return pmax(ST[a][k], ST[b - (1 << k) + 1][k]);
}
int build(int l, int r) {
    if (l > r) return 0;
    int pos = calc(l, r);
    son[pos][0] = build(l, pos - 1);
    son[pos][1] = build(pos + 1, r);
    return pos;
}
int sze[300010];
ll f[300010][2];
void dfs1(int cur) {
    if (cur == 0) return;
    dfs1(son[cur][0]);
    dfs1(son[cur][1]);
    sze[cur] = sze[son[cur][0]] + sze[son[cur][1]] + 1;
    f[cur][0] = f[son[cur][0]][0] + f[son[cur][1]][0] + sze[son[cur][1]];
    f[cur][1] = f[son[cur][1]][1] + f[son[cur][0]][1] + sze[son[cur][0]];
}
ll ans[300010], a[300010];
void dfs2(int cur) {
    if (cur == 0) return;
    a[son[cur][0]] += sze[son[cur][1]] * 2 + 1 + f[son[cur][1]][0] + a[cur];
    a[son[cur][1]] += sze[son[cur][0]] * 2 + 1 + f[son[cur][0]][1] + a[cur];
    ans[cur] = a[cur] 
             + sze[son[cur][1]] + f[son[cur][1]][0]
             + sze[son[cur][0]] + f[son[cur][0]][1];
    dfs2(son[cur][0]);
    dfs2(son[cur][1]);
}
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", p + i);
    buildST();
    rt = build(1, n);
    dfs1(rt);
    dfs2(rt);
    for (int i = 1; i <= n; i++) printf("%lld%c", ans[i], " \n"[i == n]);
}