Find the count of numbers less than N having exactly 9 divisors.
First Line of Input contains the number of testcases. Only Line of each testcase contains the number of members N in the rival gang.
Print the desired output.
2 40 5
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.