Given a value N. The task is to find how many numbers less than or equal to N have numbers of divisors exactly equal to 3.
The first line contains integer T, denoting number of test cases. Then T test cases follow. The only line of each test case contains an integer N.
For each testcase, in a new line, print the answer of each test case.
1 <= T <= 103
1 <= N <= 1012
Testcase 1: There is only one number 4 which has exactly three divisors 1, 2 and 4.
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.