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;

void cnt_yks(vector<int> &yks,int x){
  
  int y = x;
  for(int i=2;i<=y;i++){
    while(y%i==0){
    	y /= i;
    	yks[i]++;
    }
  }
  return;
}

int main() {
  
  int n; cin >> n;
  vector<int> yks(n+1,0);
    
  for(int i=2; i<=n; i++){
    cnt_yks(yks,i);
  }
  
  long long ans = 1;
  for(int i=2; i<=n; i++){
    if(yks[i]>0){
      ans = (ans*(yks[i]+1)) % 1000000007;
    }
  } 

  cout << ans << endl;
}