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;
int num[1005];
const int Mod = 1e9 + 7;

void gen(int x, int n){
    for (int i = 2; i <= n; ++i){
    while (x % i == 0){
      num[i]++;
      x /= i;
    }
  }
}

int main(void){
  int N;
  cin >> N;
  long long res = 1;
  for (int j = 2; j<= N; ++j) gen(j, N);
  for (int k = 2; k<= N; ++k) res = (res* (num[k]+1)) % Mod;
  cout << res << endl;
}