output_description: Print N lines. In the i-th line, print the total cost of travel during the
  trip when the visit to Spot i is canceled.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: # coding: utf-8
  import re
  import math
  from collections import defaultdict
  from collections import deque
  from fractions import Fraction
  import itertools
  from copy import deepcopy
  import random
  import time
  import os
  import queue
  import sys
  import datetime
  from functools import lru_cache
  
  # @lru_cache(maxsize=None)
  readline = sys.stdin.readline
  sys.setrecursionlimit(2000000)
  # import numpy as np
  alphabet = "abcdefghijklmnopqrstuvwxyz"
  mod = int(10**9 + 7)
  inf = int(10**20)
  
  
  def yn(b):
      if b:
          print("yes")
      else:
          print("no")
  
  
  def Yn(b):
      if b:
          print("Yes")
      else:
          print("No")
  
  
  def YN(b):
      if b:
          print("YES")
      else:
          print("NO")
  
  
  class union_find:
      def __init__(self, n):
          self.n = n
          self.P = [a for a in range(N)]
          self.rank = [0] * n
  
      def find(self, x):
          if x != self.P[x]:
              self.P[x] = self.find(self.P[x])
          return self.P[x]
  
      def same(self, x, y):
          return self.find(x) == self.find(y)
  
      def link(self, x, y):
          if self.rank[x] < self.rank[y]:
              self.P[x] = y
          elif self.rank[y] < self.rank[x]:
              self.P[y] = x
          else:
              self.P[x] = y
              self.rank[y] += 1
  
      def unite(self, x, y):
          self.link(self.find(x), self.find(y))
  
      def size(self):
          S = set()
          for a in range(self.n):
              S.add(self.find(a))
          return len(S)
  
  
  def is_pow(a, b):  # aはbの累乗数か
      now = b
      while now < a:
          now *= b
      if now == a:
          return True
      else:
          return False
  
  
  def getbin(num, size):
      A = [0] * size
      for a in range(size):
          if (num >> (size - a - 1)) & 1 == 1:
              A[a] = 1
          else:
              A[a] = 0
      return A
  
  
  def get_facs(n, mod_=0):
      A = [1] * (n + 1)
      for a in range(2, len(A)):
          A[a] = A[a - 1] * a
          if mod_ > 0:
              A[a] %= mod_
      return A
  
  
  def comb(n, r, mod, fac):
      if n - r < 0:
          return 0
      return (fac[n] * pow(fac[n - r], mod - 2, mod) * pow(fac[r], mod - 2, mod)) % mod
  
  
  def next_comb(num, size):
      x = num & (-num)
      y = num + x
      z = num & (~y)
      z //= x
      z = z >> 1
      num = y | z
      if num >= (1 << size):
          return False
      else:
          return num
  
  
  def get_primes(n, type="int"):
      if n == 0:
          if type == "int":
              return []
          else:
              return [False]
      A = [True] * (n + 1)
      A[0] = False
      A[1] = False
      for a in range(2, n + 1):
          if A[a]:
              for b in range(a * 2, n + 1, a):
                  A[b] = False
      if type == "bool":
          return A
      B = []
      for a in range(n + 1):
          if A[a]:
              B.append(a)
      return B
  
  
  def is_prime(num):
      if num <= 1:
          return False
      i = 2
      while i * i <= num:
          if num % i == 0:
              return False
          i += 1
      return True
  
  
  def ifelse(a, b, c):
      if a:
          return b
      else:
          return c
  
  
  def join(A, c=""):
      n = len(A)
      A = list(map(str, A))
      s = ""
      for a in range(n):
          s += A[a]
          if a < n - 1:
              s += c
      return s
  
  
  def factorize(n, type_="dict"):
      b = 2
      list_ = []
      while b * b <= n:
          while n % b == 0:
              n //= b
              list_.append(b)
          b += 1
      if n > 1:
          list_.append(n)
      if type_ == "dict":
          dic = {}
          for a in list_:
              if a in dic:
                  dic[a] += 1
              else:
                  dic[a] = 1
          return dic
      elif type_ == "list":
          return list_
      else:
          return None
  
  
  def pm(x):
      return x // abs(x)
  
  
  def inputintlist():
      return list(map(int, input().split()))
  
  
  ######################################################################################################
  def main():
      n = int(input())
      A = inputintlist()
      ssum = abs(0 - A[0]) + abs(0 - A[-1])
      for a in range(n - 1):
          ssum += abs(A[a] - A[a + 1])
      A = [0] + A + [0]
      for a in range(1, n + 1):
          ans = (
              ssum
              - (abs(A[a] - A[a - 1]) + abs(A[a] - A[a + 1]))
              + abs(A[a - 1] - A[a + 1])
          )
          print(ans)
  
  
  main()
  
problem_description: Statement
  
  There are N sightseeing spots on the x-axis, numbered 1, 2, ..., N. Spot i is
  at the point with coordinate A_i. It costs |a - b| yen (the currency of Japan)
  to travel from a point with coordinate a to another point with coordinate b
  along the axis.
  
  You planned a trip along the axis. In this plan, you first depart from the
  point with coordinate 0, then visit the N spots in the order they are
  numbered, and finally return to the point with coordinate 0.
  
  However, something came up just before the trip, and you no longer have enough
  time to visit all the N spots, so you decided to choose some i and cancel the
  visit to Spot i. You will visit the remaining spots as planned in the order
  they are numbered. You will also depart from and return to the point with
  coordinate 0 at the beginning and the end, as planned.
  
  For each i = 1, 2, ..., N, find the total cost of travel during the trip when
  the visit to Spot i is canceled.
samples: [{"input": "3\n    3 5 -1", "output": "12\n    8\n    10\n    \n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit\nto Spot i is canceled, are as follows:\n\n  * For i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n  * For i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n  * For i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\n* * *"}, {"input": "5\n    1 1 1 2 0", "output": "4\n    4\n    4\n    2\n    4\n    \n\n* * *"}, {"input": "6\n    -679 -2409 -3258 3095 -3291 -4462", "output": "21630\n    21630\n    19932\n    8924\n    21630\n    19288"}]