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

const int mod = 1e9 + 7;
int cnt[1010];
int n;

void po(int m)
{
	while (m != 1) {
		for (int i = 2; ; ++i)
			if (m % i == 0){
				m /= i;
				cnt[i]++;
				break;
			}
	}
}

int main()
{
	cin >> n;

	for (int i = 1; i <= n; ++i){
		po(i);
	}

	long long ans = 1;
	for (int i = 0; i < 1010; ++i){
		if (cnt[i]){
			ans *= (cnt[i] + 1);
			ans %= mod;
		}
	}

	cout << ans << endl;
}
