#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

ll n;

ll cost(ll i, ll j) {
 
	if(i <= j) {
		return j - i;
	}else{
		return n + j - i;
	}
}

void solve() {

	cin >> n;

	vector<ll> v(n+1, 0);
	vector<ll> loc(n+1, 0);
	for(ll i =1 ; i <= n; i++) {
		cin >> v[i];
		loc[v[i]] = i;
	}

	ll basecost = 0;
	for(ll i = 1; i < n; i++) {
		basecost += cost(loc[i], loc[i+1]);
	}

	vector<ll> ans(n+1, 0);

	for(ll i = 1; i <= n; i++) {

		// minden elemnek megvan, hogy hol van a tole eggyel nagyobb levo
		// es o addig kell elmennjen
		// ket extra dolog tortenik: megvan, hogy a harmas hova kell mennjen
		// illetve a kivett elem elotti most nem hozzaig kell mennjen, hanem az ahhoz kovetkezohoz

		// tehat effektive : basecost, cost(n, n+1) - cost(v[i]-1, v[i]) - cost(v[i], v[i]+1) + cost(v[i]-1, v[i]+1)
		
		// az i-n van az n+1-es

		ll c = 0;

		if(i == 1) {

			c = basecost + cost(loc[n], loc[i]) - cost(loc[i], loc[i+1]);

		}else if(i == n) {

			c = basecost;

		}else{

			c = basecost + cost(loc[n], loc[i]) - cost(loc[i-1], loc[i]) - cost(loc[i], loc[i+1]) + cost(loc[i-1], loc[i+1]);
		}
		
		ans[loc[i]] = c;
	}

	for(ll i = 1; i <= n; i++) {
		cout << ans[i] << " ";
	}

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	solve();

	return 0;
}