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
from collections import Counter

n = int(input())
prime = []

def P(x):
	i = 2
	while x != 1:
		if x%i == 0:
			prime.append(i)
			x //= i
		else:
			i += 1

for j in range(1,n+1):
	P(j)


D = Counter(prime)
ans = 1 
for v in D.values():
	ans = ans*(v+1)%(10**9+7)
print(ans)