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 distance(a, b):
      return abs(a[0] - b[0]) + abs(a[1] - b[1])
  
  
  n = 0
  
  H, W = input().split()
  H = int(H)
  W = int(W)
  r = []
  for i in range(H):
      r.append(input().split())
  stones = []
  print(r)
  for i in range(H):
      for j in range(W):
          if r[i][0][j] == "#":
              stones.append([j, i])
  
  for i in range(len(stones)):
      for j in range(i + 1, len(stones)):
          d = distance(stones[i], stones[j])
          for k in range(j + 1, len(stones)):
              if distance(stones[i], stones[k]) > d or distance(stones[j], stones[k]) > d:
                  continue
              if distance(stones[i], stones[k]) == distance(stones[j], stones[k]) == d:
                  n += 1
                  print(stones[i], stones[j], stones[k])
  print(n)
  
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"}]