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: Time Limit Exceeded)

#include<stdio.h>
int main(void){
  long int n,num=0;
  long int mul=0;
  scanf("%ld",&n);
  for(int loop=n;loop=1;loop--){
    mul*=loop;
  }  
  for(int loop=0;loop<9;loop++){
    num*=10;
  }
  num+=7;
  long int ans=mul%num;
  printf("%ld",ans);
  return 0;
}