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 sys
  
  sys.setrecursionlimit(10**6)
  
  
  def main():
      n = int(input())
      lst = []
      for _ in range(n):
          lst += [int(input())]
      lst.sort()
      ylst = lst[::-1]
      mini = 10000000000
      ans = 0
      zlst = []
      if n % 2 == 1:
          zlst = [lst[0]]
          for i in range(int((n - 1) / 2)):
              if i % 2 == 0:
                  zlst = [ylst[i]] + zlst + [ylst[i + 1]]
              else:
                  zlst = [lst[i]] + zlst + [lst[i + 1]]
          for i in range(n - 1):
              ans += abs(zlst[i + 1] - zlst[i])
          print(ans)
      else:
          for i in range(int(n / 2)):
              zlst += [lst[i], ylst[i]]
          for i in range(n):
              ans += abs(zlst[(i + 1) % n] - zlst[i])
              mini = min(mini, abs(zlst[(i + 1) % n] - zlst[i]))
          print(ans - mini)
      return
  
  
  main()
  
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"}]