import math

n = int(eval(input()))



def div(m):

  d = {}

  temp = int(math.sqrt(m))+1

  for i in range(2, temp):

    while m%i== 0:

      m //= i

      if i in d:

        d[i] += 1

      else:

        d[i] = 1

  if d == {}:

    d[m] = 1

  else:

    if m in d:

      d[m] += 1

    elif m != 1:

      d[m] =1

  return d



from collections import Counter



d = {}

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

  d = dict(Counter(d)+Counter(div(i)))

#print(d)

ans = 1

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

  ans *= (i+1)

  ans %= 10**9+7

print(ans)



import math



def factorize(n):

    d = {}

    temp = int(math.sqrt(n))+1

    for i in range(2, temp):

        while n%i== 0:

            n //= i

            if i in d:

                d[i] += 1

            else:

                d[i] = 1

    if d == {}:

        d[n] = 1

    else:

        if n in d:

            d[n] += 1

        elif n != 1:

            d[n] =1

    return d



n = int(eval(input()))



if n == 1:

    print((1))

    exit()



mod = 10**9+7

D = {}

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

    d = factorize(i)

    for k, v in list(d.items()):

        if k not in D:

            D[k] = v

        else:

            D[k] += v

ans = 1

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

    ans *= (v+1)

    ans %= mod

print(ans)
import math

n = int(eval(input()))


def div(m):
    d = {}
    temp = int(math.sqrt(m)) + 1
    for i in range(2, temp):
        while m % i == 0:
            m //= i
            if i in d:
                d[i] += 1
            else:
                d[i] = 1
    if d == {}:
        d[m] = 1
    else:
        if m in d:
            d[m] += 1
        elif m != 1:
            d[m] = 1
    return d


from collections import Counter

d = {}
for i in range(2, n + 1):
    d = dict(Counter(d) + Counter(div(i)))
# print(d)
ans = 1
for i in list(d.values()):
    ans *= i + 1
    ans %= 10**9 + 7
print(ans)

import math


def factorize(n):
    d = {}
    temp = int(math.sqrt(n)) + 1
    for i in range(2, temp):
        while n % i == 0:
            n //= i
            if i in d:
                d[i] += 1
            else:
                d[i] = 1
    if d == {}:
        d[n] = 1
    else:
        if n in d:
            d[n] += 1
        elif n != 1:
            d[n] = 1
    return d


n = int(eval(input()))
if n == 1:
    print((1))
    exit()
mod = 10**9 + 7
D = {}
for i in range(2, n + 1):
    d = factorize(i)
    for k, v in list(d.items()):
        if k not in D:
            D[k] = v
        else:
            D[k] += v
ans = 1
for v in list(D.values()):
    ans *= v + 1
    ans %= mod
print(ans)

-n = int(eval(input())) - -def div(m): +def factorize(n): -    temp = int(math.sqrt(m)) + 1 +    temp = int(math.sqrt(n)) + 1 -        while m % i == 0: -            m //= i +        while n % i == 0: +            n //= i -        d[m] = 1 +        d[n] = 1 -        if m in d: -            d[m] += 1 -        elif m != 1: -            d[m] = 1 +        if n in d: +            d[n] += 1 +        elif n != 1: +            d[n] = 1 -from collections import Counter - -d = {} +n = int(eval(input())) +if n == 1: +    print((1)) +    exit() +mod = 10**9 + 7 +D = {} -    d = dict(Counter(d) + Counter(div(i))) -# print(d) +    d = factorize(i) +    for k, v in list(d.items()): +        if k not in D: +            D[k] = v +        else: +            D[k] += v -for i in list(d.values()): -    ans *= i + 1 -    ans %= 10**9 + 7 +for v in list(D.values()): +    ans *= v + 1 +    ans %= mod