Sakshi was contesting to be the most stylist person in his college. He had to collect maximum points from the judges to be able to win. However there was a problem. The judges were sitting in a line and each pair of adjacent judges had ego issues with each other. So if one judge gave X points to Rahul then the next judge won’t give him any points. Rahul had a friend in the organizing team and through him he had found out the exact points he would get from each judge if he chose their score to be considered. Help him find out the maximum points he can score.

INPUT

The first line of input contains the number of test cases, T.

Each test case starts with a number N, the number of judges.

The next line will have N numbers, number of points each judge gave Harry

The order of the judges does not change.

OUTPUT

For each test case print “Case T: A” without quotes in a single line.

T is the case number, starting with 1.

A is the maximum number of points Harry can collect.

CONSTRAINTS

0 < T < = 10

0 ≤ N < = 10^4.

0 < = X(i) < = 10^9.

SAMPLE INPUT
2
5
1 2 3 4 5
1
10

SAMPLE OUTPUT
Case 1: 9
Case 2: 10

见题面

见题面