#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(ll i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll inf=1e9+7;

ll n;
ll A[500010];
ll m[500010];
set<ll> s;

int main(){
    cin>>n;
    ll ans;
    REP(i,0,n){
        cin>>A[i];
        if(A[i]==n){
            s.insert(i);
            ans = n-i-1;
        }
        m[A[i]]=i;
    }
    ll tmp;
    RREP(i,1,n){
        s.insert(m[i]);
        tmp = distance(s.find(m[i]), s.end())-1;
        //p(tmp);
        ans += n - (m[i]+1) - tmp;
    }
    p(ans);
    REP(i,0,n-1){
        ans += n - A[i] - (A[i]-1);
        p(ans);
    }

    return 0;
}