output_description: Print the maximum possible sum of the absolute differences between the
  adjacent elements after arranging the given integers in a row in any order you
  like.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1
      :
      A_N
attempt: def read():
      N = int(input().strip())
      A = []
      for _ in range(N):
          a = int(input().strip())
          A.append(a)
      return N, A
  
  
  def solve(N, A):
      A = sorted(A)
      low = A[: N // 2]
      high = A[N // 2 :]  # 奇数ならlen(low) + 1
      B = [0] * N
      for i in range(len(high)):
          B[i * 2] = high.pop()
      for i in range(len(low)):
          B[i * 2 + 1] = low.pop(0)
      sub = [0] * N
      for i in range(N):
          sub[i] = abs(B[i] - B[(i - 1) % N])
      return sum(sub[1 : N - 1]) + max(sub[0], sub[N - 1])
  
  
  if __name__ == "__main__":
      inputs = read()
      print("%d" % solve(*inputs))
  
problem_description: Statement
  
  You are given N integers; the i-th of them is A_i. Find the maximum possible
  sum of the absolute differences between the adjacent elements after arranging
  these integers in a row in any order you like.
samples: [{"input": "5\n    6\n    8\n    1\n    2\n    3", "output": "21\n    \n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute\ndifferences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6\n- 2| = 21. This is the maximum possible sum.\n\n* * *"}, {"input": "6\n    3\n    1\n    4\n    1\n    5\n    9", "output": "25\n    \n\n* * *"}, {"input": "3\n    5\n    5\n    1", "output": "8"}]