This page is still under construction.

Parts of this page are still being built. What you see may change.

Rice Sack

Time limit1sMemory limit128 MB

Summary
For each test case, print the heaviest of the five given sack weights in the required case format.
Level

Easy1 of 10

Topics
Array
Solved
No attempts yet

Problem

Several sacks of rice have to be carried to five orphanages. The heaviest sack goes to Al-Ameen Orphanage, which takes in the most children, and the lightest one goes to Mutiara Orphanage, where few children stay.

Given the weights of a row of rice sacks, decide which sack goes to Al-Ameen.

Input

The first line contains one integer, the number of test cases.

Each of the following lines contains five integers separated by blanks, the weights of five rice sacks. No sack weighs more than 100 units.

Output

For each test case, print one line in the format Case #x: w, where x is the test case number starting from 1 and w is the weight of the rice sack that goes to Al-Ameen.

Examples1

  1. Example 1

    Input
    4
1 6 10 5 20
5 10 25 3 1
30 15 5 1 8
7 4 20 50 5
    Expected output
    Case #1: 20
Case #2: 25
Case #3: 30
Case #4: 50