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
import collections
N=input()

a=[]
def soinsu_bunkai(x):
	if x==1:
		a.append(1)
		return a
	n=x
	flag=0
	while flag!=1:
		for i in range(2,x+1):
			if n%i==0:
				n=n/i
				if n==1:
					flag=1
				#print i
				a.append(i)
				break
	return a


for i in range(2,N+1):
	soinsu_bunkai(i)

#print a

b=collections.Counter(a)
#print b

ans=1
for i in b.values():
	ans*=(i+1)

print ans%(10**9+7)