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: import itertools
  import numpy as np
  
  data_num = int(input())
  data = [int(input()) for i in range(data_num)]
  # data_num=5
  # data=[6,8,1,2,3]
  
  data.sort()
  npdata = np.array(data)
  
  parts1 = [1]
  parts2 = [2 for i in range(data_num - 2)]
  parts1.extend(parts2)
  parts1.append(1)
  npparts1 = np.array(parts1)
  
  parts0 = [(-1) ** (i + 1) for i in range(data_num)]
  npparts0 = np.array(parts0)
  
  y = npparts1 * npparts0
  
  y = y.tolist()
  y.sort()
  
  y = np.array(y)
  z1 = sum(data * y)
  
  parts01 = [(-1) ** i for i in range(data_num)]
  npparts0 = np.array(parts01)
  
  y = npparts1 * npparts0
  
  y = y.tolist()
  y.sort()
  y = np.array(y)
  z2 = sum(data * y)
  
  print(max(z1, z2))
  
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"}]