Goodbye, Code Jam

Every year in April and May, Google Code Jam takes place. Sadly, Google decided to end the Google Coding Competition, which it had run since 2023 in various forms such as Code Jam, Kick Start, and Hash Code. Despairing that he could no longer receive a T-shirt, Beoshri decided to make a problem that remembers Google Code Jam.

Google Code Jam proceeds in the order of Qualification Round, Round 1, Round 2, Round 3, and World Finals. Except for World Finals, which has no next round, and the Qualification Round, which advances anyone with 30 or more points, a contestant must place within a fixed rank to advance. Round 1 requires a top $4\,500$ finish, Round 2 requires a top $1\,000$ finish, and Round 3 requires a top $25$ finish to advance to the next round.

The input is given from standard input in the following format.

The first line contains the number of test cases $T$. $(1 \le T \le 100)$

For each test case, the first line contains $N$, the rank the participant achieved in the last round they entered. $(1 \le N \le 30\,000)$

Google Code Jam has a tradition of printing Case #$x$: before the output of the $x$-th test case. Beoshri wants solvers to follow this convention, so the output format is fixed as follows.

For each test case, print one line in the form Case #$x$: $y$. Here $x$ is the test case number starting from 1, and $y$ is the name of the last round the participant entered.

Round 1 is made of three rounds, Round 1A, Round 1B, and Round 1C, and advancing requires a top $1\,500$ finish in one of them. The problem uses $4\,500$ for simplicity.