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;
int main(){
  long long int n,ans=1;
  vector<int> v(n);
  cin>>n;
  rep(i,n) v[i]=1;
  for(int i=1;i<=n;i++){
    int k=i;
    for(int j=2;j<=i;j++){
      while(k%j==0){
        v[j-1]++;
        k/=j;
      }
    }
  }
  for(int i=1;i<n;i++){
    ans*=v[i];
    ans%=1000000007;
  }
  cout<<ans<<endl;
}



