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;

  int y[1001];
int main(){
  int n;
  long long ans=1;

  cin >> n;

  
  for(int i=2; i<=n; ++i){
    int work = i;
    for(int k=2; k<=work; ++k){
      if(work%k == 0){
	work/=k;
	++y[k];
	--k;
      }
    }
  }

  for(int i=2; i<1001; ++i){
    if(y[i] > 0){
      ans *= (y[i] + 1);
      ans %= 1000000007;
    }
  }
  
  cout << ans << endl;
  
  return 0;
}