406056: GYM102253 A Add More Zero

There is a youngster known for amateur propositions concerning several mathematical hard problems.

Today he is going to prepare a thought-provoking problem on a specific type of supercomputer which has the ability to support calculating operations for integers between $$$0$$$ and $$$(2^m - 1)$$$ (inclusive).

As a young man born with ten fingers, he loves the powers of $$$10$$$ so much, which results in his eccentricity that he always ranges integers he would like to use from $$$1$$$ to $$$10^k$$$ (inclusive).

For ease of processing, all integers he would probably use in this interesting problem ought to be as computable as this supercomputer could.

Given the positive integer $$$m$$$, your task is to determine maximum possible integer $$$k$$$ that is suitable for the specific supercomputer.

The input contains multiple (about $$$10^5$$$) test cases.

Each test case in only one line contains an integer $$$m$$$ ($$$1 \leq m \leq 10^5$$$).

For each test case, output "Case #x: y" in one line (without quotes), where $$$x$$$ indicates the case number starting from $$$1$$$, and $$$y$$$ denotes the answer to the corresponding case.

1
64

Case #1: 0
Case #2: 19