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 main(void){
  long long N[1001], i, j, x,ans=1;
  scanf("%lld", &N[0]);
  for(i=1; i<=N[0]; i++){
    j=2;
    x=i;
	while(x!=1){
      if(x%j==0){
        x=x/j;
        N[j]++;
        j=2;
      }else{j++;}
    }
  }
  for(i=1;i<=N[0];i++){
    ans=(ans%1000000007)*(N[i]+1);
  }
  printf("%lld", ans%1000000007);
}