We are giving you a number N and your task is to generate a N digit string where the string reading from forward and backward are the same and lexicographically smallest. The generated string must contain only digits (0-1).
Input starts with an integer T (≤ 10), denoting the number of test cases.
Each test case starts with an integer N (1<=N<=10) where N denoting the number of digits.
For each test case, print a line in the format, "Case T: S", where T is the case number and S is the desired digit string.
| Input | Output |
|---|---|
3 1 2 3 | Case 1: 0 Case 2: 00 Case 3: 000 |