Evil Forest

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)


The Bear, king of the forest, loves painting very much. His masterpiece – “Back in time” is very famous around all over the forest. Recently he wants to hold a series painting competition to select those animals who are good at painting as well. So the Bear appoints his minister Tiger to help him prepare the painting competitions.
Tiger owns a stationery factory which produces sketchpad, so he wants to let all the competitions use the sketchpads produced by his factory privately. The Bear plans to hold $N$ painting competitions, and informs Tiger of the number of competitors who are ready for each competition. One competitor needs only one sktechpad in one competition. For each competition, at least 10% extra sketchpads are required as backup just in case.
The Tiger assigns you, his loyal subordinate to calculate the minimum number of sketchpads produced
by his factory.


The first line of the input gives the number of test cases, $T$. $T$ test cases follow.
For each test case, the first line contains an integer $N$, where $N$ is the number of competitions. The next line contains $N$ integers $a_1, a_2, . . . , a_N$ representing the number of competitors in each competition.
$1 \leq T \leq 100$
$1 \leq N \leq 1000$
$1 \leq ai \leq 100$


For each test case, output one line containing “Case #x: y”, where $x$ is the test case number (starting from 1) and $y$ is the minimum number of sketchpads that should be produced by Tiger’s factory.

Sample Input

1 6 13 11 11 11 13 11

Sample Output

Case #1: 82
For the first test case, two more sketchpads should be prepared for each painting competition.