Palindromic Primes
Submissions: 266   Accuracy:

29.72%

  Difficulty: Easy   Marks: 2

palindromic prime (sometimes called a palprime) is a prime number that is also a palindromic number.

Given a number n, output the count of numbers less than or equal to n which are palindromic prime.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.

Output:

Print the count of numbers less than or equal to n which are palindromic prime. Print the answer for each test case in a new line.


Constraints:

1<= T <=100

1<= N <=1000000


Example:

Input:

2

10

20

Output:

4

5

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

Contributor: Sujnesh Mishra
Author: sujnesh


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.