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>
using namespace std;
int main(){
  int array[1005]={0};
  long long int n;
  cin>>n;
  array[1]=1;
  


  for(int j=n;j>1;j--){
    int i=2;
    long long temp=j;
    while(temp>1){
      if(temp%i==0){
	array[i]++;
	temp/=i;
      }else{
	i++;
      }
    }
  }
  
  long long int cnt=1;
  for(int i=2;i<=n;i++){
    if(array[i]!=0){
      cnt=(cnt*(array[i]+1))%1000000007;
    }
  }
  
  cout<<cnt<<endl;
  return(0);
}
 