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: n = int(input())
  p = input().rstrip().split(" ")
  S = 0
  if len(p) == 2:
      print(int(p[0]) + int(p[1]))
  elif len(p) == 3:
      print((int(p[1]) * 2) + int(p[0]) + int(p[2]))
  else:
      l = []
      for i in range(0, len(p)):
          l.append(int(p[i]))
      S = list(l)
      while len(l) >= 3:
          t = min(l)
          C = l.index(t)
          if C == 0:
              l[C] = l[C] + l[C + 1]
              l[C + 2] = l[C + 2] + l[C + 1]
              del l[C + 1]
          elif C == len(l) - 1:
              l[C - 2] = l[C - 2] + l[C - 1]
              l[C] = l[C] + l[C - 1]
              del l[C - 1]
          else:
              l[C - 1] = l[C - 1] + l[C]
              l[C + 1] = l[C + 1] + l[C]
              del l[C]
      A = l[0] + l[1]
      S.reverse()
      l = S
      while len(l) >= 3:
          t = min(l)
          C = l.index(t)
          if C == 0:
              l[C] = l[C] + l[C + 1]
              l[C + 2] = l[C + 2] + l[C + 1]
              del l[C + 1]
          elif C == len(l) - 1:
              l[C - 2] = l[C - 2] + l[C - 1]
              l[C] = l[C] + l[C - 1]
              del l[C - 1]
          else:
              l[C - 1] = l[C - 1] + l[C]
              l[C + 1] = l[C + 1] + l[C]
              del l[C]
      B = l[0] + l[1]
      print(min(A, B))
  
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"}]