For this Question: Given a number 'N'. The task is to find the Nth number whose each digit is a prime number(<10) i.e 2, 3, 5, 7. In other words you have to find nth number of this sequence : 2, 3, 5, 7, 22, 23 ,.. and so on.The first line contains a single integer T i.e. the number of test cases. The first and only line of each test case consists of a single integer N. 

Constraints:
1 <= T <= 100
1 <= N <= 100000For each testcase print the nth number of the given sequence made of prime digits in a new line.Input:
2
10
21

Output:
33
222

Explanation:
Testcase 1: 10th number in the sequence of numbers whose each digit is prime is 33.
Testcase 2: 21th number in the sequence of numbers whose each digit is prime is 222., I have written this Solution Code: def nthprimedigitsnumber(number):
    num=""
    while (number > 0):
        rem = number % 4
        if (rem == 1):
            num += '2'
        if (rem == 2):
            num += '3'
        if (rem == 3):
            num += '5'
        if (rem == 0):
            num += '7' 
        if (number % 4 == 0):
            number = number - 1 
        number = number // 4 
    return num[::-1]
T=int(input())
for i in range(T):
    number = int(input())
    print(nthprimedigitsnumber(number)), In this Programming Language: Python, Now tell me if this Code is compilable or not?