Neville found a magical deck of cards numbered from 2 to 1,00,000. Neville will pick up a card and he has to tell the number of ways he can make that number printed on card by using their prime factors else he will die. He doesn’t know how to find this. Being Neville's friend you have to help her in finding out number of permutations.

Input Format

First line of the input consists of an integer T (no. of testcases).
Each testcase contains a single integer N.

Constraints

1 <= T <= 100000
1 < N <= 100000

Output Format

Print a single integer (number of ways she can make a number by their prime factors) for each testcase.