Given N, consider a convex N-sided polygon with vertices labelled A[0], A[i], ..., A[N-1] in clockwise order.
Suppose you triangulate the polygon into N-2 triangles.  For each triangle, the value of that triangle is the product of the labels of the vertices, and the total score of the triangulation is the sum of these values over all N-2 triangles in the triangulation.
Return the smallest possible total score that you can achieve with some triangulation of the polygon.
 



Example 1:
Input: [1,2,3]
Output: 6
Explanation: The polygon is already triangulated, and the score of the only triangle is 6.


Example 2:

Input: [3,7,4,5]
Output: 144
Explanation: There are two triangulations, with possible scores: 3*7*5 + 4*5*7 = 245, or 3*4*5 + 3*4*7 = 144.  The minimum score is 144.


Example 3:
Input: [1,3,1,4,1,5]
Output: 13
Explanation: The minimum score triangulation has score 1*1*3 + 1*1*4 + 1*1*5 + 1*1*1 = 13.

 
Note:

3 <= A.length <= 50
1 <= A[i] <= 100

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "class Solution:\n    \n    \n    def minScoreTriangulation(self, A: List[int]) -> int:\n        \n        #dp = [[0 for i in range(50)] for j in range(50)]\n        dp = dict()\n        def helper(i, j):\n            if (i, j) in dp:\n                return dp[(i, j)]\n            \n            if j-i <= 1:\n                dp[(i, j)] = 0\n                return dp[(i, j)]\n            \n            minval = float('inf')\n            for k in range(i+1, j):\n                #print(i, k, j, A[i]*A[j]*A[k])\n                val = helper(i, k) + helper(k, j) + A[i]*A[j]*A[k]\n                minval = min(minval, val)\n            dp[(i, j)] = minval\n            #print(i, j, minval)\n            return dp[(i, j)]\n        \n        return helper(0, len(A)-1)\n    \n    def minScoreTriangulation3(self, A: List[int]) -> int:\n        \n        if len(A) < 3:\n            return 0\n        \n        if len(A) == 3:\n            return A[0]*A[1]*A[2]\n        \n        def multi_array(B, j):\n            #print(B[j%len(B)],B[(j+1)%len(B)],B[(j+2)%len(B)])\n            return B[j%len(B)]*B[(j+1)%len(B)]*B[(j+2)%len(B)]\n        \n        # \n        sum1, sum2 = 0, 0\n        A_copy = A.copy()\n        sum1 += multi_array(A, 0)\n        A_copy.pop(1)\n        sum1 += self.minScoreTriangulation(A_copy)\n        \n        sum1 += multi_array(A, len(A)-1)\n        A.pop(0)\n        sum2 += self.minScoreTriangulation(A_copy)\n        \n        return min(sum1, sum2)\n    \n    def minScoreTriangulation2(self, A: List[int]) -> int:\n        \n        if len(A) < 3:\n            return 0\n        \n        if len(A) == 3:\n            return A[0]*A[1]*A[2]\n        \n        def multi_array(B, j):\n            print(B[j%len(B)],B[(j+1)%len(B)],B[(j+2)%len(B)])\n            return B[j%len(B)]*B[(j+1)%len(B)]*B[(j+2)%len(B)]\n        \n        # \n        sum1, sum2 = 0, 0\n        next_A = []\n        for i in range(len(A)//2):\n            sum1 += multi_array(A, i*2)\n            print(i, sum1, multi_array(A, i*2))\n            next_A.append(A[(i*2)%len(A)])\n           \n        #print(i, i*2, )\n        if (i*2+2)%len(A) != 0:\n            next_A.append(A[(i*2+2)%len(A)])\n            \n        print(next_A, sum1)\n        sum1 += self.minScoreTriangulation(next_A)\n            \n        print(sum1, '\\\n')\n        val = A.pop(0)\n        A.append(val)\n        next_A = []\n        for i in range(len(A)//2):\n            \n            sum2 += multi_array(A, i*2)\n            print(i, sum2)\n            next_A.append(A[(i*2)%len(A)])\n        if (i*2+2)%len(A) != 0:\n            next_A.append(A[(i*2+2)%len(A)])\n        print(next_A, sum2)\n        sum2 += self.minScoreTriangulation(next_A)\n        \n        return min(sum1, sum2)"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'minScoreTriangulation'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6450