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>
#include<algorithm>
#include<vector>
#define LL long long
const LL mod = 1e9 + 7;
LL m[1010];
bool s[1010];
LL N;
LL ans = 1;
int main() {
	std::cin >> N;
	for (int i = 2; i <= N; i++) {
		int copy = i;
		for (int j = 2; j <= i; j++) {
			while (!(copy%j)) {
				m[j]++;
				copy/=j;
			}
		}
	}
	for (int i = 2; i <= N; i++)ans *= (m[i] + 1), ans %= mod;
	std::cout << ans << std::endl;
	return 0;
}