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 = 1000000007

N = int(input())

dic = {}
for i in range(1,N+1):
  tmp = i
  k = 2
  while tmp != 1:
    if tmp%k == 0:
      if k in dic:
        dic[k] += 1
      else:
        dic[k] = 1
      tmp //= k
      k = 2
    else:
      k += 1

ans = 1
for i in dic.values():
  ans = ans*(i+1) %mod
  #print(i, ans)
#print(dic)
print(ans)