### A simple water problem

Time Limit: 1000 ms
Memory Limit: 65536 KiB

#### Problem Description

Dragon is watching competitions on TV. Every competition is held between two competitors, and surely Dragon\'s favorite. After each

competition he will give a score of either 0 or 1 for each competitor and add it to the total score of that competitor. The total score begins

with zero. Here\'s an example: four competitors with name James, Victoria, Penghu, and Digo. First goes a competition between Penghu

and Digo, and Dragon enjoys the competition and draw both 1 score for them. Then there’s a competition between James and Victoria,

but this time Dragon draw 1 for Victoria and 0 for James. Lastly a competition between James and Digo is held, but this time Dragon

really dislike the competition and give zeroes for each of them.

Finally we know the score for each one: James--0, Victoria--1, Penghu--1, Digo--1. All except James are the Winner!

However, Dragon\'s mom comes back home again and close the TV, driving Dragon to his homework, and find out the paper with scores

of all competitors. Dragon\'s mom wants to know how many competition Dragon watched, but it\'s hard through the paper. Here comes the

problem for you, given the scores of all competitors, at least how many competitions had Dragon watched?

#### Input

The first line of input contains only one integer T(<=10), the number of test cases. Following T blocks, each block describe one test case.

For each test case, the first line contains only one integers N(<=100000), which means the number of competitors. Then a line contains N integers (a1,a2,a3,...,an).ai(<=1000000) means the score of i-th competitor.

#### Output

Each output should occupy one line. Each line should start with "Case #i: ", with i implying the case number. Then for each case just puts a line with one integer, implying the competition at least should be watched by dragon.

#### Sample Input

1 3 2 3 4

#### Sample Output

Case #1: 5