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
#!/usr/bin/env python


def read():
    return input()


def work(N):
    divisor2cnt = {}
    for i in range(1, N + 1):
        num = i
        divisor = 2
        
        while divisor * divisor <= num:
            while num % divisor == 0:
                num /= divisor
                if divisor not in divisor2cnt:
                    divisor2cnt[divisor] = 1
                else:
                    divisor2cnt[divisor] = divisor2cnt[divisor] + 1
            divisor += 1
        
        if num != 1:
            if num not in divisor2cnt:
                divisor2cnt[num] = 1
            else:
                divisor2cnt[num] = divisor2cnt[num] + 1

    ans = 1
    for (divisor, cnt) in divisor2cnt.items():
        ans = ans * (cnt + 1) % 1000000007
    print ans


if __name__ == "__main__":
    work(read())
