N = int(eval(input()))

if N == 1:

    print((1))

    exit()

P = 10**9+7

d = {}

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

    k = i

    for j in range(2,i):

        while i%j == 0:

            i = i//j

            if j in list(d.keys()):

                d[j] += 1

            else:

                d[j] = 1

    if k == i:

        d[i] = 1

ans = 1

for v in list(d.values()):

    ans = ans*(v+1)%P

print(ans)

def prime_factor(n):

    ass = []

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

        while n%i == 0:

            ass.append(i)

            n = n//i

    if n != 1:

        ass.append(n)

    return ass





n = int(eval(input()))



prime = []

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

    prime = prime + prime_factor(i)



from collections import Counter



primec = Counter(prime)



ans = 1



primec_list = primec.most_common()



mod = 10**9+7



for p in primec_list:

    ans = ans * (p[1]+1) % mod



print(ans)
N = int(eval(input()))
if N == 1:
    print((1))
    exit()
P = 10**9 + 7
d = {}
for i in range(2, N + 1):
    k = i
    for j in range(2, i):
        while i % j == 0:
            i = i // j
            if j in list(d.keys()):
                d[j] += 1
            else:
                d[j] = 1
    if k == i:
        d[i] = 1
ans = 1
for v in list(d.values()):
    ans = ans * (v + 1) % P
print(ans)

def prime_factor(n):
    ass = []
    for i in range(2, int(n**0.5) + 1):
        while n % i == 0:
            ass.append(i)
            n = n // i
    if n != 1:
        ass.append(n)
    return ass


n = int(eval(input()))
prime = []
for i in range(2, n + 1):
    prime = prime + prime_factor(i)
from collections import Counter

primec = Counter(prime)
ans = 1
primec_list = primec.most_common()
mod = 10**9 + 7
for p in primec_list:
    ans = ans * (p[1] + 1) % mod
print(ans)

-N = int(eval(input())) -if N == 1: -    print((1)) -    exit() -P = 10**9 + 7 -d = {} -for i in range(2, N + 1): -    k = i -    for j in range(2, i): -        while i % j == 0: -            i = i // j -            if j in list(d.keys()): -                d[j] += 1 -            else: -                d[j] = 1 -    if k == i: -        d[i] = 1 +def prime_factor(n): +    ass = [] +    for i in range(2, int(n**0.5) + 1): +        while n % i == 0: +            ass.append(i) +            n = n // i +    if n != 1: +        ass.append(n) +    return ass + + +n = int(eval(input())) +prime = [] +for i in range(2, n + 1): +    prime = prime + prime_factor(i) +from collections import Counter + +primec = Counter(prime) -for v in list(d.values()): -    ans = ans * (v + 1) % P +primec_list = primec.most_common() +mod = 10**9 + 7 +for p in primec_list: +    ans = ans * (p[1] + 1) % mod