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: Wrong Answer)

using System;
using System.Collections;
class Program
{
	private static Hashtable sosu;
	static void Main(string[] args)
	{
		int input = int.Parse(Console.ReadLine());
		sosu = new Hashtable();
		AddSosu(input);
		double answer = CountSosu() % (Math.Pow(10,9) + 7);
		Console.WriteLine(answer);
	}

	static void AddSosu(int num){
		if(num == 1) return;

		int origin = num;
		for(int i=2; i<=origin; i++){
			while(num % i == 0){
				if(sosu[i] == null)
					sosu[i] = 0;
				
				sosu[i] = (int)sosu[i] + 1;

				num /= i;
			}
		}
		AddSosu(origin - 1);
	}
	static double CountSosu(){
		double result = 1;
		foreach (int item in sosu.Values)
		{
			result *= (1+item);
		}
		return result;
	}
}