Number of Divisors
Problem
Given an integer N print total number of divisors of N. It is guaranteed that N is a multiple of prime numbers less than 106.
Input
First line contains T (number of test cases).
Next T lines contains integer N.
Constraints
1 <= T <= 100
1 <= N <= 1018
Time Limit: 1
Memory Limit: 256
Source Limit:
