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
// arc067_a.cc
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;

	vector<int> A(1005);
	for (int i = 2; i <= n; i++) {
		int a = i;
		for (int j = 2; a > 1; j++) {
			while (a % j == 0) {
				A[j]++;
				a /= j;
			}
		}
	}

	long long sum = 1;
	const long long mod7 = 1e9 + 7;
	for (int i = 0; i < A.size(); i++) {
		if (A[i] == 0) continue;
		sum = (sum * (A[i] + 1)) % mod7;
	}
	cout << sum;
}