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
abed_mist11:
20200911 16:07:46
Good problem 

vineetjai:
20200817 07:28:28
n=0 cost me 1 WA. 

pganguly:
20200812 15:25:09
Not printing Case #: cost me a WA :( 

surajxd:
20200812 12:24:36
@s_tank00_ chup mc 

s_tank00_:
20200730 15:02:10
suggestion : frame a recursive solution then go for dp..... best of luck ;) 

vickyvanshaj:
20200603 17:29:51
Use long...cost me 1 WA


a_k_s_iitg:
20200530 23:09:41
Kindly look at the output format carefully costed me 5 WA's 

pradeep_7:
20200528 03:35:46
Try :


raju248:
20200527 06:24:17
weird! got NZEC in python but no error in C++ with same implementation 

izhang05:
20200507 05:55:40
Can there be a new line at the end of the output? 
Added by:  hossamyosef 
Date:  20130513 
Time limit:  1.237s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  FCIS/ASU Local Contest 2013 