DIVFACT  Divisors of factorial
Given a number, find the total number of divisors of the factorial of the number.
Since the answer can be very large, print answer modulo 10^{9}+7.
Input
The first line contains T, number of testcases.
T lines follows each containing the number N.
Output
Print T lines of output each containing the answer.
Example
Input: 3 2 3 4 Output: 2 4 8
Constraints
1 <= T <= 500
0 <= N <= 50000
hide comments
anujms:
20190408 20:35:05
Given constraints are incorrect, the code didn't give TLE when I replaced Upper limit from 50000 to 100005 

anil180031050:
20190227 09:53:44
hi guys.i am submitting the code for many testcases it is passing .but it is showing time limit exceeded and can anyone of them give some test cases 

knakul853:
20181010 11:34:01
50th : ) 

s_a_k_s_h_a_m:
20180612 18:27:04
good question! take care of 0! and inverse modulo


ayushgupta1997:
20180102 13:31:27
Used Legendre's Formulation 

kspoj:
20170615 19:37:24
same here @pranjalikumar9 :(( 

marshalsahu:
20170525 20:33:39
don't know why my code is getting wrong on test case 6... anyone here have any idea about it????


rayhan50001:
20170306 18:44:57
nice question i already solved this type of problem like prime factorize of factorial.. it's quite easy when you fiqure out... :D 

kira28:
20161209 16:40:25
a typical sieve prob!!! 

spartax:
20161126 04:19:53
long caused me 5 WA's 
Added by:  ivar.raknahs 
Date:  20150117 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 JSMONKEY 
Resource:  Own 