BETA

Difficulty Level: Easy

Submissions: 251 Accuracy:

24.7%

No of Factors of n!
     

Given a positive integer n, find the no of factors in n! .

Input:

The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of one line. The first line of each test case consists of an integer N.

Output:

Corresponding to each test case, in a new line, print the no of factors in n!.

Constraints:

1 ≤ T ≤ 100
0 ≤ N ≤ 100

Example:

Input
2
5
4

Output
16

8

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.