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# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace arc_067_C
{
    class Program
    {
        static void Main(string[] args)
        {
            int gh = int.Parse(Console.ReadLine());
            int a = gh * (gh + 1) / 2;
            int ans = 1;
            for (int i = 0; i <= a / 2; i++)
            {
                if (a % i == 0) { ans++; }
            }
            Console.WriteLine(ans);
        }
    }
}