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 < (int)(n); i++)
 
using ll = long long;
const int MOD = 1000000007;

int main() {
  int n;cin>>n;
  int an[1001];rep(i,1001)an[i]=0;
  rep(i,n) {
    int x=i+1;
    int j=2;
    while (x>1 and j<=x) {
      if (x%j==0) {
        an[j]++;
        x /= j;
      } else {
        j++;
      }
    }
  }
  ll ans=1;
  rep(i,1000) {
    ans = (ans * (an[i+1]+1)) % MOD;
  }
  cout << ans;
}
