An interesting prime number is a prime number which can be written as a^{2} + b^{4} where a and b are positive integers. The smallest interesting prime is 2 = 1^{2} + 1^{4}. 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^{5}

**Example:**

**Input**

4

3

10

100

1000

**Output**

1

2

6

28

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.

VivSisMMM | 164 |

d_Coder00 | 163 |

ajayjadhav35 | 153 |

Astikeysingh | 148 |

Sathvik Avasarala | 143 |

Pulkit__Sharma__ | 658 |

Anirban166 | 565 |

abducodes | 542 |

Sathvik Avasarala | 506 |

Found_me | 494 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.