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>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;

int cnt[1005];
const int mod=1e9+7;

int main(){
  int n;
  cin>>n;
  for(int i=2;i<=n;i++){
    int a=i;
    for(int j=2;j<=i;j++){
      while(a%j==0){
	cnt[j]++;
	a/=j;
      }
    }
  }
  ll ans=1;
  for(int i=2;i<=n;i++){
    if(cnt[i]) ans=ans*(cnt[i]+1)%mod;
  }
  cout<<ans<<endl;
  return 0;
}


