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

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

hide comments
2015-08-25 22:00:03
4 WA coz of space before newline ;(
2015-08-22 06:53:09 ziadxkabakibi
simple DP for beginners ^_^
be careful about the output format,the array size and use long long int for 10^9
2015-08-20 18:36:26 burninggoku
I m proud to be an INDIAN..............:))))))))))))))))))......infinity times
2015-08-20 14:38:58 Asad Rahman
first DP :D
2015-08-17 17:58:40 Babu
Be careful as in a case n will be 0,the ans in that case is 0
2015-08-13 11:17:16 jarvis
vivek garg :P thanks :D me too got 1 WA and 2 runtime cause of zero :P
finally .......Accepted!


Last edit: 2015-08-13 11:17:42
2015-08-10 19:17:03 VIVEK GARG
There is a space after ':' .
2015-08-05 23:58:55 sarvagya
easiest dp problem !
2015-07-31 21:02:41 Aditya Kumar
n can be 0 too...
2015-07-29 19:26:25 Narendra pal
space after : cost me 2 wa...finally ac ;*
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.