#include <vector>
#include <cstdio>
#include <utility>
#include <tuple>
#include <algorithm>

using ll = long long;

int main() {
    int n;
    std::scanf("%d", &n);
    std::vector<ll> p(n);
    for (int i = 0; i < n; i++) {
        std::scanf("%lld", &p[i]);
    }

    auto solve = [](std::vector<ll> &p) {
        int n = p.size();
        std::vector<std::tuple<ll, ll, ll>> stack;
        std::vector<ll> ans(n);
        ll sum = 0;

        for (int i = 0; i < n; i++) {
            ll cx = 1, ax = 0;
            while (!stack.empty() && std::get<0>(stack.back()) < p[i]) {
                auto [k, c, a] = stack.back();
                stack.pop_back();
                cx += c;
                ax += c + a;
                sum -= c + a;
            }
            stack.push_back({p[i], cx, ax});
            // std::printf("{%d, %d, %lld}\n", p[i], cx, ax);
            ans[i] = sum + ax;
            sum += cx + ax;
        }

        return ans;
    };

    std::vector<ll> ans1 = solve(p);
    std::reverse(p.begin(), p.end());
    std::vector<ll> ans2 = solve(p);
    std::reverse(ans2.begin(), ans2.end());
    
    for (int i = 0; i < n; i++) {
        std::printf("%lld ", ans1[i] + ans2[i]);
    }
    std::printf("\n");
}