Taru and Chandu both are getting bored. So Taru thinks to play a game and he gives a number to Chandu and asks him to find the number of combinations formed by divisors in form of prime.     
For example:-
For N   = 36 divisor in form of prime are ( 2 , 2 , 3 , 3 )
Number of combinations formed by prime divisor of 36 are 8.
Check the sample I/O for better understanding.

INPUT-
Number of test cases T. Next T lines contain a number N.

OUTPUT-
Number of different combinations formed by divisors in form of prime of N. 

CONSTRAINTS-
1 ≤ T ≤ 100
1 ≤N ≤ 10^12

SAMPLE INPUT
1
36

SAMPLE OUTPUT
8

Explanation

2,2,3,3  are divisors in form of prime for 36 and different/unique combinations formed are -
(2) , (3) , (2,3) , (2,2) , (2,2,3) , (3,3) , (2,2,3,3) , (2,3,3).
from itertools import combinations
def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

if __name__ == '__main__':
	t=int(raw_input())
	while t>0:
		n=int(raw_input())
		p=prime_factors(n)
		coms=set()
		for i in range(1,len(p)+1):
			for k in combinations(p,i):
				coms.add(k)
		print len(coms)
		t-=1