number-of-divisors-14
Source: hackerearth
Difficulty: EASY

Given an integer N print total number of divisors of N. It is guaranteed that N is a multiple of prime numbers less than 10^6.

Input 
First line contains T (number of test cases). 
Next T lines contains integer N.  
Constraints

1 ≤ T ≤ 100 
1 ≤ N ≤ 10^18

SAMPLE INPUT
6
1
2
3
4
5
20

SAMPLE OUTPUT
1
2
2
3
2
6