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
n = int(input())

prime = []
for i in range(2,1001):
	f = True
	for j in range(2,i):
		if i % j == 0:
			f = False
			break
	if f == True:
		prime.append(i)


c,total = 1,1

for p in prime:
	if p > n:
		continue
	for i in range(1,100):
		if p**i <= n:
			c += n // p**i
		else:
			total *= c
			c = 1
			break
		
print(total % (10**9+7))
