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 109+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
:.Mohib.:: 2015-06-28 15:11:09

I like it!! Awsm que!! ;)

jas.py: 2015-06-14 15:51:57

sieves+power of prime(in factorial)->AC

mani_mckinnon: 2015-05-26 18:45:53

Made it after tough job....
Time : 0.1s memory 2M

vishwajit kumar vishnu: 2015-03-26 10:00:23

Getting wrong answer on test case 5. Can someone help :(

Sue: 2015-03-23 17:12:58

a good problem :))
got AC with time=5.15, mem=995M :3

Raghav Aggiwal Again: 2015-03-23 14:51:12

http://ideone.com/********
Getting wa :( . @admin : Plz help

(Francky) => Use forum for any help ; as stated by the notes.

got ac .. silly mistake :(

Last edit: 2015-03-24 19:09:28
kartikay singh: 2015-02-27 18:35:55

need some test cases ..
:{

Sayak Haldar: 2015-02-07 14:50:47

try divfact2,divfact3 and divfact4 after that....:P

rajat arora: 2015-02-04 11:17:27

constraints are wrong, so take some margin

(Francky) ⇒ You are wrong, and constraints are OK.

Last edit: 2015-02-04 13:17:14
epsilon: 2015-01-24 12:08:07

oh yes i realize it later!!!!!thanks


Added by:ivar.raknahs
Date:2015-01-17
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 JS-MONKEY
Resource:Own