在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。

试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。

【输入文件】

包含两行，第1 行是正整数n（1<=n<=100），表示有n堆石子。

第2行有n个数，分别表示每堆石子的个数。 -Around in a circular playground placed n heap stones. Stones are to be combined into an orderly pile. Provisions can only choose two adjacent pile into a new pile of stones, a pile of stones and a few new record score for the merger. Try to design an algorithm to calculate the n heap into a pile of stones combined minimum score and maximum score. [Input file] contains two lines, line 1 is a positive integer n (1 < = n < = 100), that has n heap stones. Line 2 n numbers, respectively, the number of stones for each heap.