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;

int calc_factorial(int n)
{
	int n_factorial = 1;
	for(int i = 1; i <= n; i++)
	{
		n_factorial *= i;	
	}

	return n_factorial;
}

int main()
{
	int n;
	cin >> n;
	
	int n_factorial = calc_factorial(n);

	int num_of_factors = 0;
	for(int i = 1; i <= n; i++)
	{
		num_of_factors += calc_factorial(i);	
	}
	
	int ans = num_of_factors % 1000000007;

	cout << ans;
	return 0;
}