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
# -*- coding: utf-8 -*-

import collections

def factorial(n):
    a = 1
    for i in xrange(1, n + 1):
        a *= i
    return a

def prime_decomposition(n):
    i = 2
    counter = []
    while i < n:
        while n % i == 0:
            n /= i
            counter.append(i)
        i += 1

    if n > 1:
        counter.append(n)
    return counter

n = input()
a = factorial(n)

res = [v for v in collections.Counter(prime_decomposition(a)).values()]

divisor = 1
for i in res:
    divisor *= (1 + i)

print divisor % (10 ** 9 + 7)
