Given a number '**N**'. The task is to find the N^{th} number whose each digit is a prime number 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.

**Input:**

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 an integer **N**.

**Output: **

In one line print the nth number of the given sequence made of prime digits.

**Constraints:**

1 <= T <= 100

1 <= N <= 100

**Examples:
Input:**

2

10

21

**Output:**

33

222

**Explanation:
Testcase 1:** 10

Author: saksham0751

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

bhatabhi554 | 365 |

CodeBuddy | 335 |

hardikJain5 | 318 |

Akkki111 | 261 |

clone | 238 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

mazumderrohit8 | 1186 |

RemoveTLE | 1165 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4611 |

Quandray | 4444 |

Login to report an issue on this page.