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())

mod = 10**9 + 7
d = {}

for i in range(2,n+1):
	x = i
	for j in range(2,x+1):
		while x % j == 0:
			x = x // j
			d[j] = d.get(j, 0) + 1

ret = 1
for v in d.values():
	ret *= v+1

print(ret % mod)
