Challenges

Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 1735
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 2715
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 1351
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 2162
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 3196
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2236
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1628
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 3720
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2565
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2524
Dcoder Admiration
Please select a challenge
Problem Statement
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

Input
T the number of test cases. For each test case an integer N

Output
A single integer representing the number of members with odd admirers.

Constraints
1 < T < 100 1 < N < 10^9

Sample Input
1
5

Sample Output

3

Dcoded By: Rajat Gupta

Solved By: 429

Maximum Marks: 10