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<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int n,i,j,x[1000],a,b;
	long long cnt;
	scanf("%d",&n);
	for(i=1;i<1000;i++)	x[i]=0;
	for(i=2;i<=n;i++)	{
		a=2;	b=i;
		while(b>1)	{
			if(b%a==0)	{
				x[a]++;
				b/=a;
			}
			else a++;
		}
	}
	cnt=1;
	for(i=1;i<1000;i++)	{
		if(x[i]!=0)	{
			cnt=cnt*(x[i]+1);
			cnt%=1000000007;
		}
	}
	printf("%lld\n",cnt);
	return 0;
}