Challenge: A cipher (which is a positive integer) which has any substring not divisible by 2, or has a substring divisible by 11 (other than 0), is defined as 'bad'. All other ciphers are defined as 'good'. Find the kth cipher, in ascending order, which is 'good'.
The first line of input has a single integer T, the total number of test cases. The next T lines each have an integer k on them.
The output should contain T integers on T different lines, the kth good cipher.