Nine Divisors
Submissions: 2014   Accuracy:

9.99%

  Difficulty: Medium   Marks: 4

Find the count of numbers less than N having exactly 9 divisors.

Input:
First Line of Input contains the number of testcases. Only Line of each testcase contains the number of members N in the rival gang.

Output:
Print the desired output.

Constraints:

1<=T<=1000
1<=N<=10^12

Example:
Sample Input:

2
40
5

Sample Output:

1
0

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

Author: jain_rishabh


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.