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;
#define endl "\n"
#define MOD 1000000007

int prime[1005];

int main(){
  int N;
  cin>>N;
  for(int i=1;i<=N;i++){
    int m = i;
    for(int j=2;j<=sqrt(m);j++){
      while(m%j == 0){
        prime[j]++;
        m /= j;
      }
    }
    if(m != 1)
      prime[m]++;
  }
  long long ans = 1;
  for(int i=2;i<=N;i++)
    if(prime[i])
      ans = ans * (prime[i] + 1) % MOD;
  cout<<ans<<endl;
  return 0;
}
