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;
typedef long long ll;

ll mod=1e9+7;



int main() {
  ll num;
  cin >> num;
  map<ll,ll> res;
  for(ll j=2;j<=num;j++) {
    ll n=j;
    for(int i=2;i*i<=n;i++) {
      while(n%i==0) {
        res[i]++;
        n/=i;
      }
    }
    if(n!=1) {
      res[n]++;
    }
  }
  ll ans=1;
  for(auto p:res) {
    ans=ans*(p.second+1)%mod;
  }
  cout << ans << endl;
}