**Problem Description**

**Input**

The first line contain a integer T （T<=10） represents the test case

For each test there is a number n （n<=50000） mentioned in description

**Output**

For each test output the number of divisors (pls mod 1e9+7).

**Sample Input**

2 8 20

**Sample Output**

96 41040

**Source**

2018绍兴市联赛