Minimum Cost Tree From Leaf Values

Given the in-order leaf values of a binary tree in which every non-leaf node has two children and its value is the product of the largest leaf in its left subtree and the largest leaf in its right subtree, print the minimum possible sum of all non-leaf node values.

2 <= n <= 40 1 <= value <= 15