Problem Description

Ada gives John a positive integer $N$. She challenges him to construct a new number (without leading zeros), that is a multiple of $9$, by inserting exactly one digit ($0 \ldots 9$) anywhere in the given number $N$. It is guaranteed that $N$ does not have any leading zeros.

As John prefers smaller numbers, he wants to construct the smallest such number possible. Can you help John?

Input Format

The first line of the input gives the number of test cases, $T$. $T$ test cases follow.

Each test case has a single line containing a positive integer $N$: the number Ada gives John.

Output Format

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 new number constructed by John. As mentioned earlier, $y$ cannot have leading zeros.

3
5
33
12121

Case #1: 45
Case #2: 333
Case #3: 121212

Hint

In Sample Case #$1$, there are only $2$ numbers that can be constructed satisfying the divisibility constraint: $45$ and $54$. John chooses the smaller number.

In Sample Case #$2$, $333$ is the only number possible.

In Sample Case #$3$, there are $4$ possible options - $212121$, $122121$, $121221$ and $121212$ - out of which the smallest number is $121212$.

Limits

$1 \le T \le 100$.

Test Set $1$

$1 \le N \le 10^5$.

Test Set $2$

For at most $10$ cases:

$1 \le N \le 10^{123456}$.

For the remaining cases:

$1 \le N \le 10^5$.