Next Prime Palindrome
Submissions: 931   Accuracy:

17.18%

  Difficulty: Easy   Marks: 2

You will be given a positive integer N. Your task is to find the smallest number greater than or equal to N that is a prime and a palindrome.
 

Input:
The first line of input contains a single integer T denoting the number of test cases.
Then T test cases follow. The first and only line of each test case consists of N.

 

Output:
Corresponding to each test case, in a new line, print the smallest number greater than or equal to N that is a prime and a palindrome.

 

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 107

 

Example:

Input
3
188
4
872

Output
191
5
919

** For More Input/Output Examples Use 'Expected Output' option **

Author: Hemang Sarkar


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.