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<bits/stdc++.h>

using namespace std;

const int md=1e9+7;

long long ans=1;
int n;
int pf[10000];

int main()
{
	scanf("%d",&n);
	int tmp=n;
	
	for(int i=1;i<=n;i++)
	{
		int x=i;
		for(int j=2;j<=x;j++)
			while(x%j==0)
			{
				pf[j]++;
				x/=j;
			}
	}
	
	for(int i=1;i<1000;i++)
	{
		ans*=(pf[i]+1);
		ans=ans%md;
	}
	
	cout<<ans;	
	return 0;
}