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 REP(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
const int MOD = 1e9+7;

int main() {
  int n,ans=1; cin>>n;
  vector<ll> cnt(n+1, 0);
  for(int i=1; i<=n; i++){
    int b=i;
    for(int j=2; j<=n; j++) {
      while(b%j==0) {
        b/=j;
        cnt[j]++;
      }
    }
  }
  REP(i,n+1) ans = ans*(cnt[i]+1)%MOD;
  cout<<ans<<endl;
}