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: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args)throws IOException {

					  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
					  int t = Integer.parseInt(br.readLine());
					  while(t-->0)
					  {
						  int n = Integer.parseInt(br.readLine());
					     String ans = check(n);
						StringBuffer sbr = new StringBuffer(ans);
						System.out.println(sbr.reverse());

						  }

					  }

	static String check(int x)
	{
		String ans="";
		while(x>0)
		{

		switch(x%4)
		{
           case 1:ans +="2"; break;
		   case 2:ans +="3"; break;
		   case 3:ans+="5"; break;
		   case 0:ans+="7"; break;
		}
		if(x%4==0)
		x--;
		x/=4;

		}
		return ans;

	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?