All Factors Using Sieve
medium
Given t test cases and in each test case you have a positive integer n, we have to find the total number of divisors for n.
Constraints
1 <= t <= 1000 1 <= n <= 10^5
Format
Input
The first line of input contains integer t. The next t lines of the input contains integer n.
Output
Print number of divisors in a line for each test case.
Example
Sample Input
10
21
22
23
24
25
26
27
28
29
30
Sample Output
4
4
2
8
3
4
4
6
2
8