# 素因数分解問題

import math

from collections import Counter



N = int(eval(input()))

mod = 10**9+7



def prime_factorize(n):

    c = Counter()

    for i in range(2, int(math.sqrt(n))+2):

      while n % i == 0:

        c[i] += 1

        n //= i

    

    if n > 1:

      c[n] += 1

    return c



counters = []

for n in range(1, N+1):

  counters.append(Counter(prime_factorize(n)))



cnt = Counter()

for c in counters:

  for (key, val) in list(c.items()):

    cnt[key] += val

  

ans = 1



for (key, value) in list(cnt.items()):

  ans *= value + 1



print((ans % mod))
import math

from collections import Counter

N = int(eval(input()))



def factorize(n):

  cnt = Counter()



  for i in range(2, int(math.sqrt(n)) + 2):

    while n % i == 0:

      cnt[i] += 1

      n //= i



  if n > 1:

    cnt[n] += 1



  return cnt



cnts = []

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

  cnts.append(factorize(i))



base = Counter()

for c in cnts:

  for (key, value) in list(c.items()):

    base[key] += value



ans = 1

for (key, value) in list(base.items()):

  ans *= (1 + value)



mod = 10 ** 9 + 7

print((ans % mod))
# 素因数分解問題
import math
from collections import Counter

N = int(eval(input()))
mod = 10**9 + 7


def prime_factorize(n):
    c = Counter()
    for i in range(2, int(math.sqrt(n)) + 2):
        while n % i == 0:
            c[i] += 1
            n //= i
    if n > 1:
        c[n] += 1
    return c


counters = []
for n in range(1, N + 1):
    counters.append(Counter(prime_factorize(n)))
cnt = Counter()
for c in counters:
    for (key, val) in list(c.items()):
        cnt[key] += val
ans = 1
for (key, value) in list(cnt.items()):
    ans *= value + 1
print((ans % mod))

import math
from collections import Counter

N = int(eval(input()))


def factorize(n):
    cnt = Counter()
    for i in range(2, int(math.sqrt(n)) + 2):
        while n % i == 0:
            cnt[i] += 1
            n //= i
    if n > 1:
        cnt[n] += 1
    return cnt


cnts = []
for i in range(1, N + 1):
    cnts.append(factorize(i))
base = Counter()
for c in cnts:
    for (key, value) in list(c.items()):
        base[key] += value
ans = 1
for (key, value) in list(base.items()):
    ans *= 1 + value
mod = 10**9 + 7
print((ans % mod))

-# 素因数分解問題 -mod = 10**9 + 7 -def prime_factorize(n): -    c = Counter() +def factorize(n): +    cnt = Counter() -            c[i] += 1 +            cnt[i] += 1 -        c[n] += 1 -    return c +        cnt[n] += 1 +    return cnt -counters = [] -for n in range(1, N + 1): -    counters.append(Counter(prime_factorize(n))) -cnt = Counter() -for c in counters: -    for (key, val) in list(c.items()): -        cnt[key] += val +cnts = [] +for i in range(1, N + 1): +    cnts.append(factorize(i)) +base = Counter() +for c in cnts: +    for (key, value) in list(c.items()): +        base[key] += value -for (key, value) in list(cnt.items()): -    ans *= value + 1 +for (key, value) in list(base.items()): +    ans *= 1 + value +mod = 10**9 + 7