#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG_ 
#include "../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<30;

template <typename S>
struct sparseTable {
    using T = typename S::T;
    int n;
    vector<int> log2;
    vector<vector<T>> t;

    sparseTable() {}
    sparseTable(int nn) { construct(nn); }
    void construct(int nn) {
        n = nn;
        log2.assign(n+1, 0);
        for(int i=2; i<=n; ++i) log2[i] = log2[i >> 1] + 1;
        t = vector<vector<T>>(log2[n]+1, vector<T>(n));
    }
    void init(vector<T> v) {
        for(int i=0; i<n; ++i) t[0][i] = v[i];
        for(int j=1; j<=log2[n]; ++j) {
            int w = 1LL<<(j-1);
            for (int i = 0; i+(w<<1) <= n; ++i) {
                t[j][i] = S::op(t[j-1][i], t[j-1][i+w]);
            }
        }
    }
    // [l, r]
    T query(int l, int r) {
        int j = log2[r - l];
        return S::op(t[j][l], t[j][r-(1 << j)+1]);
    }
};

class LCA {
private:
    const int n = 0;
    const int log2_n = 0;
    vector<vector<int>> par;
    vector<vector<int>> g;
    vector<int> depth;     // 頂点iの深さ
    vector<int> vs;        // 頂点を訪問順に並べたもの
    vector<int> depth_seq; // depth_seq[i] = (頂点vs[i]の深さ)
    vector<int> id;        // 頂点が初めてvsに登場するインデックス
    struct minimum_st {
        using T = PII;
        static T op(const T& a, const T& b) { return min(a, b); }
    }; 
    sparseTable<minimum_st> st;
    void dfs(int v, int p, int d, int &k) {
        id[v] = k; vs[k] = v; depth_seq[k++] = d; depth[v] = d;
        for(auto to: g[v]) if(to != p) {
            dfs(to, v, d+1, k);
            vs[k] = v; depth_seq[k++] = d;
        }
    }
public:
    LCA(int n_=1e5) : n(n_), g(n), depth(n), vs(2*n-1), depth_seq(2*n-1), id(n) {}
    // u-vに辺を張る
    void add_edge(int u, int v) {
        g[u].push_back(v);
        g[v].push_back(u);
    }
    // rootを根として初期化
    void build(int root = 0) {
        int k = 0;
        dfs(root, -1, 0, k);
        vector<PII> v(2*n-1);
        REP(i, 2*n-1) v[i] = {depth_seq[i], i};
        st.construct(2*n-1);
        st.init(v);
    }
    // uとvのlcaを返す O(1)
    int get(int u, int v) {
        if(id[u] > id[v]) swap(u, v);
        return vs[st.query(id[u], id[v]).second];
    }
    int dist(int u, int v) {
        return depth[u] + depth[v] - 2*depth[get(u,v)];
    }
};

int main(void) {
    int n;
    cin >> n;
    vector<int> a(n);
    REP(i, n) cin >> a[i], a[i]--;

    // 二分探索木をつくる
    LCA lca(n);
    vector<vector<int>> g(n);
    {
        set<int> st;
        vector<int> lch(n, -1), rch(n, -1);

        st.insert(a[0]);      
        FOR(i, 1, n) {
            // a[i] が追加される位置
            // a[i]以上の最小の要素の左の子
            // a[i]未満の最大の要素の右の子

            auto itr = st.lower_bound(a[i]);
            if(itr != st.begin() && rch[*prev(itr)] == -1) {
                rch[*prev(itr)] = a[i];
            } else if(itr != st.end() && lch[*itr] == -1) {
                lch[*itr] = a[i];
            }
            st.insert(a[i]);
        }

        auto dfs = [&](auto &&self, int v) -> void {
            if(lch[v] != -1) {
                g[v].push_back(lch[v]);
                g[lch[v]].push_back(v);
                lca.add_edge(v, lch[v]);
                self(self, lch[v]);
            }
            if(rch[v] != -1) {
                g[v].push_back(rch[v]);
                g[rch[v]].push_back(v);
                lca.add_edge(v, rch[v]);
                self(self, rch[v]);
            }
        };
        dfs(dfs, a[0]);
        lca.build();
    }

    vector<int> sz(n), dead(n);
    auto find_centroid = [&](int root) {
        auto get_size = [&](auto &&self, int v, int p) -> void {
            sz[v] = 1;
            for(auto to: g[v]) if(to != p && !dead[to]) {
                self(self, to, v);
                sz[v] += sz[to];
            }
        };
        get_size(get_size, root, -1);
        auto dfs = [&](auto &&self, int v, int p) -> int {
            for(auto to: g[v]) if(to != p && !dead[to]) {
                if(sz[to] > sz[root]/2) return self(self, to, v);
            }
            return v;
        };
        return dfs(dfs, root, -1);
    };

    vector<int> par(n);
    auto centroid_decomposition = [&](auto &&self, int root, int p) -> void {
        int c = find_centroid(root);
        dead[c] = true;
        par[c] = p;
        for(auto to: g[c]) if(!dead[to]) {
            self(self, to, c);
        }
        dead[c] = false;
    };
    centroid_decomposition(centroid_decomposition, 0, -1);

    ll ret = 0;
    vector<ll> dist(n), contribution(n), cnt(n);
    REP(i, n) {
        {
            int v = a[i];
            ll add = dist[a[i]];
            while(par[v] != -1) {
                add += dist[par[v]]-contribution[v] + (cnt[par[v]]-cnt[v]) * lca.dist(par[v], a[i]);
                v = par[v];
            }
            ret += add;
            cout << ret << "\n";
        }
        {
            int v = par[a[i]], pre = a[i];
            cnt[a[i]]++;
            while(v != -1) {
                cnt[v]++;
                const ll d = lca.dist(v, a[i]);
                dist[v] += d;
                contribution[pre] += d;
                pre = v;
                v = par[v];
            }
        }
    }
    cout << flush;

    return 0;
}