Dcoder has N members each numbered from 1 to N. A member admires other member if its number divides the other member's number.
Given a number N you need to find the number of people with odd number of admirers
T the number of test cases.
For each test case an integer N
A single integer representing the number of members with odd admirers.
1 < T < 100
1 < N < 10^9