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
MOD = 10**9+7
max_n = 1000

n = int(input())

ans = 0
nums = [0]*(n+1)

for i in range(1,n+1):  
  v = i
  j = 2
  while v > 0 and i>=j:    
    if v%j==0:
      nums[j] += 1
      v = v//j      
    else:
      j+=1

ans = 1      
for i in range(n+1):
  if nums[i] > 0:
    ans *= (1+nums[i])
  ans %= MOD

print(ans)    