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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
using namespace std;
typedef long long ll;

int N;
ll inf = 1e9+7;
ll G[1000] = {0};


int main(){
	cin >> N;
	for(int i=2;i<=N;i++){
		int t = i;
		for(int j=2;j<=N;j++){
			while(t%j==0){
				G[j]++;
				t /= j;
			}
		}
	}
	ll ans = 1;
	for(int i=2;i<=N;i++){
		ans = (ans*(G[i]+1))%inf;
	}
	cout << ans << endl;
}