#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

struct FastSet {
    using u64 = u_int64_t;
    static constexpr u64 B = 64;
    u64 size;
    vector<vector<u64>> a;
    FastSet(u64 n) : size(n) {
        do a.emplace_back(n = (n + B - 1) / B);
        while(n > 1);
    }
    bool operator[](int i) { return a[0][i / B] >> (i % B) & 1; }
    void set(int i) {
        for(auto& v : a) {
            v[i / B] |= 1ULL << (i % B);
            i /= B;
        }
    }
    void reset(ll i) {
        for(auto& v : a) {
            v[i / B] &= ~(1ULL << (i % B));
            if(v[i / B]) break;
            i /= B;
        }
    }
    int next(int i) {  // i を超える最⼩の要素
        for (int h = 0; h < (int)a.size(); h++) {
            i++;
            if(i / B >= (int)a[h].size()) break;
            u64 d = a[h][i / B] >> (i % B);
            if(d) {
                i += countr_zero(d);
                while(h--) i = i * B + countr_zero(a[h][i]);
                return i;
            }
            i /= B;
        }
        return size;
    }
    int prev(int i) {  // i より小さい最⼤の要素
        for (int h = 0; h < (int)a.size(); h++) {
            i--;
            if(i < 0) break;
            u64 d = a[h][i / B] << (~i % B);
            if(d) {
                i -= countl_zero(d);
                while(h--) i = i * B + __lg(a[h][i]);
                return i;
            }
            i /= B;
        }
        return -1;
    }
};

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<int> A(N);
    vector<vector<int>> G(N + 1);
    vector<int> id(N + 1);
    rep(i, 0, N) {
        cin >> A[i];
        chmin(A[i], N);
        G[A[i]].push_back(i);
    }
    rep(i, 0, N + 1) G[i].push_back(N);
    FastSet fs(N + 1);
    vector<int> R(N + 1);
    vector<ll> ans(N + 1);
    R[N] = N + 1;
    fs.set(N);
    fs.set(0);
    auto f = [&](int pos, int val, int i) -> void {
        int l = fs.prev(pos + 1);
        if (R[l] >= val) return;
        R[pos] = R[l];
        fs.set(pos);
        l = pos;
        while (true) {
            int r = fs.next(l);
            ans[l] += ((ll)N - i) * (val - R[l]);
            ans[r] -= ((ll)N - i) * (val - R[l]);
            if (R[r] >= val) break;
            fs.reset(r);
            l = r;
        }
        R[pos] = val;
    };
    rep(i, 0, N) {
        // cout << i << endl;
        f(i, G[i][0], 0);
    }
    rep(i, 0, N - 1) {
        f(A[i], G[A[i]][++id[A[i]]], i + 1);
    }
    rep(i, 0, N) {
        ans[0] -= N - 1 - i;
        ans[N] += N;
    }
    for (auto x : ans) cout << x << "\n";
}