A number is called good if it contains only 1's and 2's. Given an integer N, the task is to find Nth good number
Note: Some good numbers are 1, 2, 11, 12, 21, 22 ........
1. The first line of the input contains a single integerT denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a single integer N.
Output: For each test case, print the Nth good number Constraints:
1. 1 <= T <= 100 2. 1 <= N <= 104