#from statistics import median

#import collections

#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]

#from fractions import gcd

#from itertools import combinations # (string,3) 3回

#from collections import deque

from collections import deque,defaultdict

#import bisect

#

#    d = m - k[i] - k[j]

#    if kk[bisect.bisect_right(kk,d) - 1] == d:

#

#

#

# pythonで無理なときは、pypyでやると正解するかも！！

#

#



import sys

sys.setrecursionlimit(10000000)

mod = 10**9 + 7

#mod = 9982443453

def readInts():

  return list(map(int,input().split()))

def I():

  return int(eval(input()))

n = I()

A = [0] + readInts() + [0]

all = 0

for i in range(1,n+2):

    all += abs(A[i-1] - A[i])

#print(all)

nya = all

for i in range(1,n+1):

    all = nya

    all -= abs(A[i-1] - A[i])

    all -= abs(A[i] - A[i+1])

    all += abs(A[i-1] - A[i+1])

    print(all)

#from statistics import median

#import collections

#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]

from fractions import gcd

from itertools import combinations,permutations,accumulate # (string,3) 3回

#from collections import deque

from collections import deque,defaultdict,Counter

import decimal

import re

#import bisect

#

#    d = m - k[i] - k[j]

#    if kk[bisect.bisect_right(kk,d) - 1] == d:

#

#

#

# pythonで無理なときは、pypyでやると正解するかも！！

#

#

# my_round_int = lambda x:np.round((x*2 + 1)//2)

# 四捨五入

import sys

sys.setrecursionlimit(10000000)

mod = 10**9 + 7

#mod = 9982443453

def readInts():

  return list(map(int,input().split()))

def I():

  return int(eval(input()))

n = I()

A = [0] + readInts() + [0]

pa = 0

for i in range(n+1):

    pa += abs(A[i+1] - A[i])

#print(pa)

for i in range(n):

    print((pa - abs(A[i+1]-A[i]) - abs(A[i+2] - A[i+1]) + abs(A[i+2] - A[i])))

# from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
# from fractions import gcd
# from itertools import combinations # (string,3) 3回
# from collections import deque
from collections import deque, defaultdict

# import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys

sys.setrecursionlimit(10000000)
mod = 10**9 + 7
# mod = 9982443453
def readInts():
    return list(map(int, input().split()))


def I():
    return int(eval(input()))


n = I()
A = [0] + readInts() + [0]
all = 0
for i in range(1, n + 2):
    all += abs(A[i - 1] - A[i])
# print(all)
nya = all
for i in range(1, n + 1):
    all = nya
    all -= abs(A[i - 1] - A[i])
    all -= abs(A[i] - A[i + 1])
    all += abs(A[i - 1] - A[i + 1])
    print(all)

# from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate  # (string,3) 3回

# from collections import deque
from collections import deque, defaultdict, Counter
import decimal
import re

# import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys

sys.setrecursionlimit(10000000)
mod = 10**9 + 7
# mod = 9982443453
def readInts():
    return list(map(int, input().split()))


def I():
    return int(eval(input()))


n = I()
A = [0] + readInts() + [0]
pa = 0
for i in range(n + 1):
    pa += abs(A[i + 1] - A[i])
# print(pa)
for i in range(n):
    print((pa - abs(A[i + 1] - A[i]) - abs(A[i + 2] - A[i + 1]) + abs(A[i + 2] - A[i])))

-# from fractions import gcd -# from itertools import combinations # (string,3) 3回 +from fractions import gcd +from itertools import combinations, permutations, accumulate  # (string,3) 3回 + -from collections import deque, defaultdict +from collections import deque, defaultdict, Counter +import decimal +import re +# my_round_int = lambda x:np.round((x*2 + 1)//2) +# 四捨五入 -all = 0 -for i in range(1, n + 2): -    all += abs(A[i - 1] - A[i]) -# print(all) -nya = all -for i in range(1, n + 1): -    all = nya -    all -= abs(A[i - 1] - A[i]) -    all -= abs(A[i] - A[i + 1]) -    all += abs(A[i - 1] - A[i + 1]) -    print(all) +pa = 0 +for i in range(n + 1): +    pa += abs(A[i + 1] - A[i]) +# print(pa) +for i in range(n): +    print((pa - abs(A[i + 1] - A[i]) - abs(A[i + 2] - A[i + 1]) + abs(A[i + 2] - A[i])))