Problem:
Score : 300 points

Problem Statement

You are given an integer N.
Find the number of the positive divisors of N!, modulo 10^9+7.

Constraints

1≤N≤10^3

Input

The input is given from Standard Input in the following format:

N

Output

Print the number of the positive divisors of N!, modulo 10^9+7.

Sample Input 1

3

Sample Output 1

4

There are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.

Sample Input 2

6

Sample Output 2

30

Sample Input 3

1000

Sample Output 3

972926972

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int sum( int n)
{
    if(n==1)
        return 1;
    long long int sum1 = n * sum(n-1);
}
int main()
{
    long long int n,sum1,c=0,i;
    scanf("%d",&n);
    sum1=sum(n);
    for(i=1; i<=sum1; i++)
    {
        if(sum1%i==0)
            c++;
    }
    printf("%d",c);

}