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
def soin(n):
	ans=[]
	l=int(n**0.5)+1
	for i in range(2,l+1):
		if n%i==0:
			a=[i,0]
			while n%i==0:
				n//=i
				a[1]+=1
			ans+=[a]
	if n>1:
		ans+=[[n,1]]
	return ans
d={}
n=int(input())
for i in range(2,n+1):
	a=soin(i)
	for j in a:
		if j[0] in d:
			d[j[0]]+=j[1]
		else:
			d[j[0]]=j[1]
k=1
for i in d.values():
	k*=(i+1)
print(k%(10**9+7))