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 mod1=1e9+7;
int n,i,a[1005],k,j;
long long t=1;

int main(){

   cin>>n;
   for(i=2;i<=n;i++)
   {
   	  k=i;
   	  for(j=2;j<=k;j++)
   	  {
   	  	while(k%j==0)a[j]++,k=k/j;
   	  
   	  }
   	  
   }
   for(i=2;i<=n;i++)
   {
   	 if(a[i]) t=t*(a[i]+1)%mod1;
   	  
   }
  cout<<t;
	return 0;
}