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