THE PROBLEM STATEMENT:

Steven has n coins. The task is that these coins are to be put into boxes such that each box contains equal coins. Let the number of boxes in which the coins are put be B. You are to count all possible values of B.

INPUT:
The first line of input contains the number of test cases t.
After this there are t lines in the input file, each line contains an integer n, the number of coins.

OUTPUT:
Output contains t lines, each line contains the output for the corresponding test case.

CONSTRAINTS:
1<=t<=1000
1<=n<=1000,000,000

Explanation for n=10.
1. We can put the coins in 10 boxes each containing 1 coin. Here we need 10 boxes. B=10
2. We can put the coins in 5 boxes each containing 2 coins. Here we need 5 boxes. B=5
3. We can also put the coins in 2 boxes each containing 5 coins. Here we need 2 boxes. B=2
4. We can also put the coins in 1 box containing 10 coins. Here we need 1 box. B=1
So, there are 4 possible values of B. Therefore the answer for n=10 is 4.