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.

ShubhamJain18 | 205 |

makeitdonesolo | 140 |

lost_found | 124 |

maggiiiii | 118 |

SahatPrasad1 | 108 |

Bishnu Dev Panda | 777 |

okayboss | 551 |

ShubhamJain18 | 516 |

yk12 | 514 |

makeitdonesolo | 480 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4925 |

Quandray | 4547 |

Login to report an issue on this page.