BETA

Difficulty Level: Easy

Submissions: 321 Accuracy:

17.13%

Next Prime Palindrome
       

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 **

Contributor: Hemang Sarkar

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

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