Problem A -- Run, Run, Runaround Numbers
Input File: a.in
Output: write to monitor

An N-digit runaround number is characterized as follows: For example, consider the number 81362. To verify that this is a runaround number, we use the steps shown below:
  1. Start with the leftmost digit, 8
    8 1 3 6 2
    -
  2. Count 8 digits to the right, ending on 6 (note the wraparound).
    8 1 3 6 2
    -     -
  3. Count 6 digits to the right, ending on 2.
    8 1 3 6 2
    -     - -
  4. Count 2 digits to the right, ending on 1.
    8 1 3 6 2
    - -   - -
  5. Count 1 digit to the right, ending on 3.
    8 1 3 6 2
    - - - - -
  6. Count 3 digits to the right, ending on 8, where we began.
    8 1 3 6 2
    = - - - -
In this problem you will be provided with one or more input lines, each with a single integer R having between 2 and 7 digits followed immediately by the end of line. For each such number, determine the smallest runaround number that is equal to or greater than R. There will always be such a number for each of the input numbers. Display the resulting number in the format illustrated below. The last line of the input will contain only the digit 0 in column 1.  Maximum lines of input is 99.

Sample Input (a.in)

12
123
1234
81111
82222
83333
911111
7654321
12
123
0

Sample Output (write to monitor)

Case  1: 13
Case  2: 147
Case  3: 1263
Case  4: 81236
Case  5: 83491
Case  6: 83491
Case  7: 913425
Case  8: 8124956
Case  9: 13
Case 10: 147