output_description: Print the maximum total happiness points the children can earn.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: tmp = input().split()
  NChild = int(tmp[0])
  
  tmp = input().split()
  Active_List = [int(s) for s in tmp]
  
  ArrayD = [0] * NChild
  
  for i in range(NChild):
      ArrayD[i] = [
          i + 1,
          Active_List[i],
          max(abs(i), abs(NChild - i - 1)),
          Active_List[i] * max(abs(i), abs(NChild - i - 1)),
      ]
  
  ArrayC = sorted(ArrayD, key=lambda x: (x[3], x[1], x[2]), reverse=True)
  
  NArray = [0] * NChild
  EndP = NChild - 1
  StartP = 0
  
  for i in range(NChild):
      P = ArrayC[i][0]
      if abs(P - StartP - 1) < abs(P - EndP - 1):
          NArray[EndP] = P
          EndP = EndP - 1
      else:
          NArray[StartP] = P
          StartP = StartP + 1
  
  TotalResult = 0
  
  for i in range(NChild):
      KeyA = ArrayC.index(ArrayD[NArray[i] - 1])
      TotalResult = TotalResult + ArrayC[KeyA][1] * abs(NArray[i] - i - 1)
  
  print(TotalResult)
  
problem_description: Statement
  
  There are N children standing in a line from left to right. The activeness of
  the i-th child from the left is A_i.
  
  You can rearrange these children just one time in any order you like.
  
  When a child who originally occupies the x-th position from the left in the
  line moves to the y-th position from the left, that child earns A_x \times
  |x-y| happiness points.
  
  Find the maximum total happiness points the children can earn.
samples: [{"input": "4\n    1 3 4 2", "output": "20\n    \n\nIf we move the 1-st child from the left to the 3-rd position from the left,\nthe 2-nd child to the 4-th position, the 3-rd child to the 1-st position, and\nthe 4-th child to the 2-nd position, the children earns 1 \\times |1-3|+3\n\\times |2-4|+4 \\times |3-1|+2 \\times |4-2|=20 happiness points in total.\n\n* * *"}, {"input": "6\n    5 5 6 1 1 1", "output": "58\n    \n\n* * *"}, {"input": "6\n    8 6 9 1 2 1", "output": "85"}]