An interesting prime number is a prime number which can be written as a2 + b4 where a and b are positive integers. The smallest interesting prime is 2 = 12 + 14. You will be given N a positive integer, you have to find the number of interesting primes less than or equal to N.
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.
Corresponding to each test case, in a new line, print the number of interesting prime numbers below N.
1 ≤ T ≤ 100
1 ≤ N ≤ 105
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.