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<iostream>
using namespace std;

const long long int INF = 1000000007;

int n, p[1001];
long long int ans;

void factor(int x){
  while(x > 1){
    for(int i = 2; i <= x; i++){
      if(x % i == 0){
	x = x / i;
	p[i]++;
	break;
      }
    }
  }
}

int main(void){
  cin >> n;
  for(int i = 2; i <= n; i++){
    factor(i);
  }
  ans = 1;
  for(int i = 0; i <= n; i++){
    ans = (ans * (p[i] + 1)) % INF;
  }
  cout << ans << endl;
}