提示: 欢迎访问OurACM平台。
Problem 1568 Harry Potter

Accept: 43    Submit: 103
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

Harry Potter has n mixtures in front of him, arranged in a row. Each mixture has one of 100 different colors (colors have numbers from 0 to 99).

He wants to mix all these mixtures together. At each step, he is going to take two mixtures that stand next to each other and mix them together, and put the resulting mixture in their place.

When mixing two mixtures of colors a and b, the resulting mixture will have the color (a + b) mod 100.

Also, there will be some smoke in the process. The amount of smoke generated when mixing two mixtures of colors a and b is a*b.

Find out what is the minimum amount of smoke that Harry can get when mixing all the mixtures together.

Input

There will be a number of test cases in the input.

The first line of each test case will contain n, the number of mixtures, 1 <= n <= 100.

The second line will contain n integers between 0 and 99 -- the initial colors of the mixtures.

Output

For each test case, output the minimum amount of smoke.

Sample Input

2 18 19 3 40 60 20

Sample Output

342 2400

Source

FOJ月赛-2008年2月

Submit  Back  Status  Discuss