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
prime = []
for i in range(2, 1001):
	prime.append(i)

i = 0
while i < len(prime):
	if prime[i] < 32: break
	j = i + 1
	while j < len(prime):
		if prime[j] % prime[i] == 0:
			prime.pop(j)
		else:
			j = j + 1
	i = i + 1

primecount = []
for i in range(0, len(prime)):
	primecount.append(0)

N = int(raw_input())

for i in range(1, N+1):
	m = i
	j = 0
	while m >= prime[j]:
		if m % prime[j] == 0:
			primecount[j] = primecount[j]+1
			m = m / prime[j]
		else:
			j = j + 1

cnt = 1
for i in range(0, len(primecount)):
	cnt = cnt * (primecount[i]+1)

print cnt % 1000000007