1029: SYH’s Easy Operating Problem

There are n elements in an array a₁~a_n. Now, SYH gives you an easy operation: Choose an element a_i (1 < i < n), and redefine it to a_i+1+a_i-1-a_i. You can do the operation as any times as you want. Try to make the sum of the n numbers as small as possible.

The first line conatins an integer T, means the number of test cases. For each test case, the first line contains an integer n. The second line contains n integers a₁ to a_n.

For each test case ouput “Case: #x:s” in a single line. x is the test case number (starting from 1), and s is your minimal possible answer.

2

4
1 2 3 4

3
1 10 2

Case #1: 10
Case #2: -4