#include <bits/stdc++.h>
using namespace std;
int n, a[150005], b[150005];
long long ans[150005], sm[150005 << 2], ad[150005 << 2], adm[150005 << 2];
int mx[150005 << 2], cmx[150005 << 2], hdm[150005 << 2], hd[150005 << 2];
void Build(int u, int l, int r) {
  sm[u] = ad[u] = adm[u] = mx[u] = cmx[u] = hdm[u] = hd[u] = 0;
  if (l == r) return;
  int m = l + r >> 1;
  Build(u << 1, l, m), Build(u << 1 | 1, m + 1, r);
}
void dtmp(int u, int v) {
  adm[u] += v, sm[u] += v * 1ll * hdm[u];
  if (hd[u]) mx[u] += v;
}
void dtp(int u, int v) {
  ad[u] += v, sm[u] += v * 1ll * hd[u];
  if (hd[u]) mx[u] += v;
  if (hd[u] && hd[u] != hdm[u]) cmx[u] += v;
}
void dt(int u) {
  if (ad[u]) {
    dtp(u << 1, ad[u]), dtp(u << 1 | 1, ad[u]);
    ad[u] = 0;
  }
  if (adm[u]) {
    if (mx[u] == mx[u << 1] + adm[u]) dtmp(u << 1, adm[u]);
    if (mx[u] == mx[u << 1 | 1] + adm[u]) dtmp(u << 1 | 1, adm[u]);
    adm[u] = 0;
  }
}
void upd(int u) {
  sm[u] = sm[u << 1] + sm[u << 1 | 1];
  mx[u] = max(mx[u << 1], mx[u << 1 | 1]);
  hdm[u] = cmx[u] = 0;
  if (mx[u] == mx[u << 1])
    hdm[u] += hdm[u << 1], cmx[u] = max(cmx[u], cmx[u << 1]);
  else
    cmx[u] = max(cmx[u], mx[u << 1]);
  if (mx[u] == mx[u << 1 | 1])
    hdm[u] += hdm[u << 1 | 1], cmx[u] = max(cmx[u], cmx[u << 1 | 1]);
  else
    cmx[u] = max(cmx[u], mx[u << 1 | 1]);
}
void ckm(int u, int l, int r, int ql, int qr, int v) {
  if (l > qr || ql > r || ql > qr || v >= mx[u]) return;
  if (ql <= l && r <= qr && v > cmx[u]) return (void)(dtmp(u, v - mx[u]));
  int m = l + r >> 1;
  dt(u);
  ckm(u << 1, l, m, ql, qr, v), ckm(u << 1 | 1, m + 1, r, ql, qr, v);
  upd(u);
}
void ins(int u, int l, int r, int p, int v) {
  if (l == r) return (void)(sm[u] = mx[u] = v, hd[u] = hdm[u] = 1);
  int m = l + r >> 1;
  dt(u);
  p <= m ? ins(u << 1, l, m, p, v) : ins(u << 1 | 1, m + 1, r, p, v);
  upd(u);
  hd[u] = hd[u << 1] + hd[u << 1 | 1];
}
void add(int u, int l, int r, int ql, int qr, int v) {
  if (l > qr || ql > r || ql > qr) return;
  if (ql <= l && r <= qr) return (void)(dtp(u, v));
  int m = l + r >> 1;
  dt(u);
  add(u << 1, l, m, ql, qr, v), add(u << 1 | 1, m + 1, r, ql, qr, v);
  upd(u);
}
int qry(int u, int l, int r, int ql, int qr) {
  if (l > qr || ql > r) return 0;
  if (ql <= l && r <= qr) return hd[u];
  int m = l + r >> 1;
  return qry(u << 1, l, m, ql, qr) + qry(u << 1 | 1, m + 1, r, ql, qr);
}
void Solve() {
  Build(1, 1, n);
  for (int i = (1), LIM = (n); i <= LIM; i++) {
    int p = qry(1, 1, n, 1, b[i] - 1) + 1;
    ckm(1, 1, n, 1, b[i] - 1, p - 1);
    ins(1, 1, n, b[i], i);
    add(1, 1, n, b[i] + 1, n, 1);
    ans[i] += sm[1];
  }
}
int main() {
  scanf("%d", &n);
  for (int i = (1), LIM = (n); i <= LIM; i++) scanf("%d", &a[i]), b[a[i]] = i;
  Solve();
  reverse(a + 1, a + n + 1);
  for (int i = (1), LIM = (n); i <= LIM; i++) b[a[i]] = i;
  for (int i = (1), LIM = (n); i <= LIM; i++) ans[i] -= 1ll * i * i;
  Solve();
  for (int i = (1), LIM = (n); i <= LIM; i++) printf("%lld\n", ans[i]);
}
