Mystery Square (Small)

I wrote down a large perfect square in binary, then replaced some of its digits with question marks. Work out what my original number was.

The first line of the input gives the number of test cases, $T$. The next $T$ lines each contain one test case: a string $S$, a perfect square written in binary with some of its digits replaced by question marks.

For each test case, print one line in the form Case #x: N, where x is the test case number starting from 1 and N is a perfect square written in binary, obtained by replacing each '?' in $S$ with either '0' or '1'.

• $1 \le T \le 25$
• $S$ begins with '1'.
• $S$ contains only the characters '0', '1' and '?'.
• In every test case there is exactly one possible choice for N.
• $S$ is at most 60 characters long.
• $S$ contains at most 20 '?' characters.