An interesting prime number is a prime number which can be written as a² + b⁴ where a and b are positive integers. The smallest interesting prime is 2 = 1² + 1⁴. You will be given N a positive integer, you have to find the number of interesting primes less than or equal to N.
 

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 number of interesting prime numbers below N.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 10⁵
 

Example:
Input
4
3
10
100
1000
Output
1
2
6
28

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