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-csc 3.5.0) (judge verdict: Wrong Answer)


using System;
using System.Collections.Generic;
using System.Linq;
class Test
{

    public static void Main()
    {
        var n = int.Parse(Console.ReadLine());
        Dictionary<int, int> dic = new Dictionary<int, int>();
        
        for(int i=2;i<=n;i++)
        {
            int x = i;

            for(int j=2;j<=n;j++)
            {
                if(x%j==0)
                {
                    if (dic.ContainsKey(j))
                        dic[j]++;
                    else
                        dic[j] = 1;
                }
            }
        }

        long ans = 1;
        
        foreach(var p in dic)
        {
            ans = ans * p.Value + 1;
            ans = ans % 1000000007;
        }

        Console.Write(ans);
    }


}