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
#ABC052C
N=int(input())
c={}
for i in range(1,N+1):
	t=0
	for k in range(2,i+1):
		t=0
		if i%k==0:
			while i%k==0:
				i//=k
				t+=1
			c[k]=c.get(k,0)+t
ans=1
for k in c.keys():
	ans*=(c[k]+1)
print(ans%(10**9+7))