#include <bits/stdc++.h>
using namespace std;

#define ff   first
#define ss   second
#define pb   push_back

typedef long long  ll;
typedef pair<ll,ll>  pii;

const ll N = 3e5 + 10;
const ll mod = 1e9 + 7;

ll st[8 * N], lazy[8 * N];

void propagate (ll node, ll l, ll r) {
  st[node] += lazy[node] * (r - l + 1);
  lazy[node << 1] += lazy[node];
  lazy[(node << 1) + 1] += lazy[node];
  lazy[node] = 0;
}

void update (ll node, ll l, ll r, ll a, ll b) {
  propagate(node, l, r);
  if (b < l || r < a) return;
  if (a <= l && r <= b) {
    lazy[node] = 1;
    propagate(node, l, r);
    return;
  }
  ll m = (l + r) >> 1;
  update (node << 1, l, m, a, b);
  update ((node << 1) + 1, m + 1, r, a, b);
  st[node] = st[node << 1] + st[(node << 1) + 1];
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL

  ll n; cin >> n;
  vector <ll> p(n);
  for (auto &e : p) cin >> e;

  vector <pii> nx = {{n + 1, n}};
  vector <ll> ans(n);

  for (ll i = n - 1; i; --i) {
    while (nx.back().ff < p[i]) nx.pop_back();
    update (1, 0, n - 1, i, nx.back().ss - 1);
//    cout << "upd " << i << ' ' << nx.back().ss << '\n';
    ans[i - 1] += st[1];
    nx.push_back( {p[i], i} );
  }

  nx = {{n + 1, -1}};
  memset(lazy, 0, sizeof lazy);
  memset(st, 0, sizeof st);

  for (ll i = 0; i + 1 < n; ++i) {
    while (nx.back().ff < p[i]) nx.pop_back();
    update (1, 0, n - 1, nx.back().ss + 1, i);
    ans[i + 1] += st[1];
    nx.push_back ( {p[i], i} );
  }

  for (ll i = 0; i < n; ++i) cout << ans[i] << ' ';
  cout << '\n';

  return 0;
}