#include <iostream>
#include<bits/stdc++.h>
typedef long long ll ;

using namespace std;

int main()
{
    ll n ;
    cin >> n ;

    ll pos[n + 1] ;
    ll posinverse[n + 1] ;
    for(int i = 1 ; i <= n ; i++)
    {
        ll u ;
        cin >> u ;

        posinverse[i] = u ;
        pos[u] = i ;
    }

    ll d[n + 1] ;
    d[n] = d[0] = 0 ;
    ll s = 0 ;
    for(int i = 1 ; i < n ; i++)
    {
        ll u = pos[i] , v = pos[i + 1] ;

        d[i] = v - u ;
        if(d[i] < 0)
            d[i] += n ;

        s += d[i] ;
    }

    ll d2[n + 1] ;
    d2[0] = d2[n] = d2[n - 1] = 0 ;
    for(int i = 1 ; i < n - 1 ; i++)
    {
        ll u = pos[i] , v = pos[i + 2] ;

        d2[i] = v - u ;
        if(d2[i] < 0)
            d2[i] += n ;
    }

    for(int i = 1 ; i <= n ;  i++)
    {
        if(posinverse[i] == n)
        {
            cout << s << " " ;
        }
        else
        {
          ll u = i - pos[n] ;
        if(u < 0)
            u += n ;

        cout << s - d[posinverse[i] ] + u - d[posinverse[i] - 1] + d2[posinverse[i] - 1] << " " ;
        }



    }



    return 0;
}