Super Primes
Submissions: 8227   Accuracy:

20.19%

  Difficulty: Medium   Marks: 4

A prime number is Super Prime if it is a sum of two primes. Find all the Super Primes upto N

Input:

The first line of input contains an integer T denoting the number of test cases.

Each line of test case contains an integer N as described in the problem

Output:

For each test case output a single line containing the total number of Super Primes upto N.


Constraints:

1<=T<=10000

1<=N<=10000000

Example:

Input:

1

5

Output:

1

Explanation:

Only 5 is Super Prime (2+3)

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

Contributor: Pranay Pandey
Author: pra1nay7_313


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.