#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

vector<ll> solve(int n, vector<int>& a) {
	vector<ll> s, ret(n, 0), b(n);
	auto upd = [&]() {
		int i = s.back();
		s.pop_back();
		ret[0] += b[i];
		ret[i] -= b[i];
		if (!s.empty())
			b[s.back()] += b[i];
	};
	for (int i = 0; i < n; i++) {
		while (sz(s) > 0 && a[s.back()] < a[i])
			upd();
		s.push_back(i);
		b[i]++;
	}
	while (sz(s) > 0)
		upd();
	for (int i = 1; i < n; i++)
		ret[i] += ret[i - 1];
	return ret;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n; cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++)
		cin >> a[i];
	auto x = solve(n, a);
	reverse(all(a));
	auto y = solve(n, a);
	for (int i = 0; i < n; i++)
		cout << x[i] + y[n - i - 1] << " \n"[i + 1 == n];
}