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<iostream>
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=2;i<=(n);i++)
using namespace std;
const int mod=1000000007;
int main()
{
int N;
cin >> N;
long ans=1;
int array[N];
rep(i,N)
{
	array[i]=i+1;
}

if(N!=1)
{
rep2(i,N)
{
	int num=0;
   rep(j,N)
	{
	   while(array[j]%i==0)
	   {
		   array[j]=array[j]/i ;
		   num++;
	   }
	}
    ans=ans*(num+1)%mod;
}
}
 cout << ans <<endl;
 return 0;
 
}