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;

#define f(i,a,b) for(int i=a;i<=b;i++)
#define md 1000000007

int n;
int a[50000];
long long ans=1;

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