Deliverable Packages

You are given several test cases. In each test case, the first number represents the total number of packages, and the following numbers represent the delivery times (in minutes from midnight) of each package. A package is considered deliverable if its delivery time falls within the allowable time window. In this problem, the allowable time window is the entire day, i.e. from \(0\) to \(1439\) minutes. Therefore, every package provided will be counted as deliverable.

Your task is to output the results for each test case in the format Case #x: y, where x is the test case number (starting from 1) and y is the number of deliverable packages (which is simply the total number of packages given for that test case).

inputFormat

The input is read from standard input (stdin) and has the following format:

T
P1 a11 a12 ... a1P1
P2 a21 a22 ... a2P2
...
PT aT1 aT2 ... aTP_T

Here, \(T\) is the number of test cases. For each test case, the first integer \(P_i\) is the total number of packages, followed by \(P_i\) integers representing the delivery times of each package.

outputFormat

For each test case, output a line in the format:

Case #x: y

where x is the 1-indexed test case number and y is the number of deliverable packages (which is the same as \(P_i\) for that test case).

## sample

1
5 300 600 1100 1230 1400

Case #1: 5

</p>