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.

Examples

Input

3


Output

4


Input

6


Output

30


Input

1000


Output

972926972
#include<vector>
#include<iostream>
using namespace std;
vector<int>v(1000, 1);
void func(int n)
{
	
	for (int i = 2; i*i <= n; i++)
	{
		if (n%i == 0)
		{
			v[i]++;
			n = n /i;
			i--;
		}
		
	}
	if (n != 1)
	{
		v[n]+=1;
	}
	
}
int main()
{
	int N;
	cin >> N;
	for (int i = 1; i <= N; i++)
	{
		func(i);
	}
	long long ans = 1;
	for (int i = 0; i < 1000; i++)
	{
		ans = (ans * v[i])%1000000007;
	}
	cout << ans << endl;
}












