output_description: Print the minimum possible sum of the integers written on the last two cards
  remaining.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: size = int(input())
  nums = list(map(int, input().split()))
  
  # size = 10
  # nums = list(map(int, "3 1 4 1 5 9 2 6 5 3".split()))
  
  fnums = nums[1 : size - 1]
  rnums = list(reversed(fnums))
  
  tmp = nums[1 : size - 1]
  tmp.sort()
  tmps = len(tmp)
  
  idxs = []
  for num in tmp:
      fix = fnums.index(num)
      lix = rnums.index(num)
      if fix <= lix:
          # print("fix")
          # print("{} {}".format(tmps, fix))
          idxs.append(fix)
          fnums[fix] = -1
          rnums[tmps - fix - 1] = -1
  
      else:
          # aaaa
          # print("lix")
          idxs.append(tmps - lix - 1)
          fnums[tmps - lix - 1] = -1
          rnums[lix] = -1
  
      # print(fnums)
      # print(rnums)
  
  first = 0
  # print(idxs)
  for i in range(0, len(idxs)):
      idx = idxs[i]
      # print("{} {}".format(idx, nums))
      n = nums.pop(idx + 1)
      nums[idx] += n
      nums[idx + 1] += n
      for j in range(0, len(idxs)):
          idxs[j] -= 1 if idxs[j] > idx else 0
  
  print(sum(nums))
  
  # 5 2 4 1 6 9
  # 5 2 5 7 9
  # 7 7 7 9
  # 14 14 9
  # 28 23
  # 51
  
problem_description: Statement
  
  There is a stack of N cards, each of which has a non-negative integer written
  on it. The integer written on the i-th card from the top is A_i.
  
  Snuke will repeat the following operation until two cards remain:
  
    * Choose three consecutive cards from the stack.
    * Eat the middle card of the three.
    * For each of the other two cards, replace the integer written on it by the sum of that integer and the integer written on the card eaten.
    * Return the two cards to the original position in the stack, without swapping them.
  
  Find the minimum possible sum of the integers written on the last two cards
  remaining.
samples: [{"input": "4\n    3 1 4 2", "output": "16\n    \n\nWe can minimize the sum of the integers written on the last two cards\nremaining by doing as follows:\n\n  * Initially, the integers written on the cards are 3, 1, 4, and 2 from top to bottom.\n  * Choose the first, second, and third card from the top. Eat the second card with 1 written on it, add 1 to each of the other two cards, and return them to the original position in the stack. The integers written on the cards are now 4, 5, and 2 from top to bottom.\n  * Choose the first, second, and third card from the top. Eat the second card with 5 written on it, add 5 to each of the other two cards, and return them to the original position in the stack. The integers written on the cards are now 9 and 7 from top to bottom.\n  * The sum of the integers written on the last two cards remaining is 16.\n\n* * *"}, {"input": "6\n    5 2 4 1 6 9", "output": "51\n    \n\n* * *"}, {"input": "10\n    3 1 4 1 5 9 2 6 5 3", "output": "115"}]