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>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;

int main(){
	int n; cin >> n;
	map<int, ll> prt;
	for( int i = 1; i <= n; ++i ){
		int t = i;
		for( int k = 2; k <= i; ++k ){
			while( t % k == 0 ){
				t /= k;
				++prt[k];
			}
		}
	}
	ll prod = 1;
	for( auto &k : prt ){
		prod *= (k.second+1);
		prod %= mod;
	}
	cout << prod << endl;
}