FARIDA - Princess Farida


Once upon time there was a cute princess called Farida living in a castle with her father, mother and uncle. On the way to the castle there lived many monsters. Each one of them had some gold coins. Although they are monsters they will not hurt. Instead they will give you the gold coins, but if and only if you didn't take any coins from the monster directly before the current one. To marry princess Farida you have to pass all the monsters and collect as many coins as possible. Given the number of gold coins each monster has, calculate the maximum number of coins you can collect on your way to the castle.

Input

The first line of input contains the number of test cases. Each test case starts with a number N, the number of monsters, 0 <= N <= 10^4. The next line will have N numbers, number of coins each monster has, 0 <= The number of coins with each monster <= 10^9. Monsters described in the order they are encountered on the way to the castle.

Output

For each test case print “Case C: X” without quotes. C is the case number, starting with 1. X is the maximum number of coins you can collect.

Example

Input:
2
5
1 2 3 4 5
1
10

Output:
Case 1: 9
Case 2: 10

hide comments
vickyvanshaj: 2020-06-03 17:29:51

Use long...cost me 1 WA

a_k_s_iitg: 2020-05-30 23:09:41

Kindly look at the output format carefully costed me 5 WA's

pradeep_7: 2020-05-28 03:35:46

Try :
1.
n=0
o/p = case 1: 0

raju248: 2020-05-27 06:24:17

weird! got NZEC in python but no error in C++ with same implementation

izhang05: 2020-05-07 05:55:40

Can there be a new line at the end of the output?

bhavya_kala10: 2020-05-01 19:07:15

Easy DP, First DP problem AC in one GO

saketvajp_123: 2020-04-18 16:46:32

done !!
solved again after 6 months ! Good question .
BUT it took three 3 WA.

raman_111: 2020-03-30 07:09:23

just a corner testcase can bring so many WA for you take care of "n==0" and the format of output properly. #HAPPY_CODING ;-)

zerodark: 2020-01-20 12:22:29

Take care of n==0.it's a silly test case.

amankumarjha: 2019-12-31 21:22:22

Finally solved, used unsigned long long, take care of printing Case c: and take care of n=0


Added by:hossamyosef
Date:2013-05-13
Time limit:1.237s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS/ASU Local Contest 2013