# 1 2 3
# 4 2 3 -> 2
# 1 4 3 -> 4
# 1 2 4 -> 2
def solv():
    N=int(input())
    P=[int(xx)-1 for xx in input().split()]
    pos=[-1]*N
    for i in range(N):
        pos[P[i]]=i
    summa=0
    for i in range(N-1):
        cur=pos[i+1]-pos[i]
        if cur>0:
            summa+=cur
        else:
            summa+=N+cur
    for i in range(N):
        if P[i]==0:
            d=pos[1]-pos[0]
            if d<0:
                d+=N
            dd=i-pos[N-1]
            if dd<0:
                dd+=N
            print(summa-d+dd,end=' ')
        elif P[i]==N-1:
            print(summa,end=' ')
        else:
            dl=i-pos[N-1]
            if dl<0:
                dl+=N
            de=i-pos[P[i]-1]
            if de<0:
                de+=N
            du=pos[P[i]+1]-i
            if du<0:
                du+=N
            da=pos[P[i]+1]-pos[P[i]-1]
            if da<0:
                da+=N
            print(summa-de-du+dl+da,end=' ')

            
    print("\r\n")
    #print(P,pos)

solv()