import collections

def e(N):

    res = []

    x = N

    y = 2

    while y*y <= x:

        while x % y == 0:

            res.append(y)

            x //= y

        y += 1

    if x > 1:

        res.append(x)

    return res

MOD = 10**9 + 7

n = int(eval(input()))

chk = [0 for i in range(n+1)]

for i in range(2, n+1):

    tmp = collections.Counter(e(i))

    for j in tmp:

        chk[j] += tmp[j]

ans = 1

for i in chk:

    if i:

        ans = ans*(i + 1)%MOD

print(ans)
MOD = 10**9 + 7

n = int(eval(input()))

chk = [0 for i in range(n+1)]

for i in range(2, n+1):

    y = 2

    while y*y <= i:

        while i % y == 0:

            chk[y] += 1

            i //= y

        y += 1

    if i > 1:

        chk[i] += 1



ans = 1

for i in chk:

    if i:

        ans = ans*(i + 1)%MOD

print(ans)
import collections


def e(N):
    res = []
    x = N
    y = 2
    while y * y <= x:
        while x % y == 0:
            res.append(y)
            x //= y
        y += 1
    if x > 1:
        res.append(x)
    return res


MOD = 10**9 + 7
n = int(eval(input()))
chk = [0 for i in range(n + 1)]
for i in range(2, n + 1):
    tmp = collections.Counter(e(i))
    for j in tmp:
        chk[j] += tmp[j]
ans = 1
for i in chk:
    if i:
        ans = ans * (i + 1) % MOD
print(ans)

MOD = 10**9 + 7
n = int(eval(input()))
chk = [0 for i in range(n + 1)]
for i in range(2, n + 1):
    y = 2
    while y * y <= i:
        while i % y == 0:
            chk[y] += 1
            i //= y
        y += 1
    if i > 1:
        chk[i] += 1
ans = 1
for i in chk:
    if i:
        ans = ans * (i + 1) % MOD
print(ans)

-import collections - - -def e(N): -    res = [] -    x = N -    y = 2 -    while y * y <= x: -        while x % y == 0: -            res.append(y) -            x //= y -        y += 1 -    if x > 1: -        res.append(x) -    return res - - -    tmp = collections.Counter(e(i)) -    for j in tmp: -        chk[j] += tmp[j] +    y = 2 +    while y * y <= i: +        while i % y == 0: +            chk[y] += 1 +            i //= y +        y += 1 +    if i > 1: +        chk[i] += 1