from math import factorial

from collections import Counter



def primes(n):

    a = [0] * (n + 1)

    a[0] = 1

    a[1] = 1

    i = 2

    while n // i >= i:

        if a[i] != 0:

            i += 1

            continue

        j = 2 * i

        while j <= n:

            a[j] = 1

            j += i

        i += 1

    for i, ai in enumerate(a):

        if ai == 0:

            yield i





n = int(eval(input()))

f = factorial(n)

counter = Counter()



while f > 1:

    for p in primes(n):

        if f % p == 0:

            counter[p] += 1

            f = f // p



ans = 1

for val in list(counter.values()):

    ans *= (val + 1)



print((ans % (10**9 + 7)))
from math import factorial

from collections import Counter



def prime(n):

    a = [0] * (n + 1)

    a[0] = 1

    a[1] = 1

    i = 2

    while n // i >= i:

        if a[i] != 0:

            i += 1

            continue

        j = 2 * i

        while j <= n:

            a[j] = 1

            j += i

        i += 1

    return [i for i, ai in enumerate(a) if ai == 0]





n = int(eval(input()))

f = factorial(n)

primes = prime(n)

counter = Counter()



while f > 1:

    for p in primes:

        if f % p == 0:

            counter[p] += 1

            f = f // p



ans = 1

for val in list(counter.values()):

    ans *= (val + 1)



print((ans % (10**9 + 7)))
from math import factorial
from collections import Counter


def primes(n):
    a = [0] * (n + 1)
    a[0] = 1
    a[1] = 1
    i = 2
    while n // i >= i:
        if a[i] != 0:
            i += 1
            continue
        j = 2 * i
        while j <= n:
            a[j] = 1
            j += i
        i += 1
    for i, ai in enumerate(a):
        if ai == 0:
            yield i


n = int(eval(input()))
f = factorial(n)
counter = Counter()
while f > 1:
    for p in primes(n):
        if f % p == 0:
            counter[p] += 1
            f = f // p
ans = 1
for val in list(counter.values()):
    ans *= val + 1
print((ans % (10**9 + 7)))

from math import factorial
from collections import Counter


def prime(n):
    a = [0] * (n + 1)
    a[0] = 1
    a[1] = 1
    i = 2
    while n // i >= i:
        if a[i] != 0:
            i += 1
            continue
        j = 2 * i
        while j <= n:
            a[j] = 1
            j += i
        i += 1
    return [i for i, ai in enumerate(a) if ai == 0]


n = int(eval(input()))
f = factorial(n)
primes = prime(n)
counter = Counter()
while f > 1:
    for p in primes:
        if f % p == 0:
            counter[p] += 1
            f = f // p
ans = 1
for val in list(counter.values()):
    ans *= val + 1
print((ans % (10**9 + 7)))

-def primes(n): +def prime(n): -    for i, ai in enumerate(a): -        if ai == 0: -            yield i +    return [i for i, ai in enumerate(a) if ai == 0] +primes = prime(n) -    for p in primes(n): +    for p in primes: