BETA

Difficulty Level: Medium

Submissions: 512 Accuracy:

9.96%

Nine Divisors
           

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 **

Contributor: jain_rishabh

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.