All Factors Using Sieve

medium
Question Solve Solutions 
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.

Input Format

The first line of input contains integer t. The next t lines of the input contains integer n.

Output Format

Print number of divisors in a line for each test case.

Constraints

1 <= t <= 1000
1 <= n <= 10^5

Example

Input
10
21
22
23
24
25
26
27
28
29
30
Output
4
4
2
8
3
4
4
6
2
8
Previous
Prime Factors Using Sieve
Next
Count Of Common Divisors

Related Questions

medium Extended Euclidean Algorithm medium Linear Diophantine Equation hard Eulers Totient Function medium Wilsons Theorem medium Modular Fast Exponentiation medium Modular C(n,r) hard No Max No Min medium Prime Factors Using Sieve easy Count Of Common Divisors medium Gcd Length medium I Hate 1111 medium Relatively Prime Pairs medium Sum Of Factors easy Chinese Remainder Theorem easy Monkey Tradition