import math

n = math.factorial(int(eval(input())))

i = 2

ans = 1

M = 10**9+7

while i*i <= n:

  cnt = 1

  while n%i == 0:

    cnt += 1

    n //= i

  ans *= cnt

  i += 1

if n != 1:

  ans *= 2

print((int(ans%M)))



def resolve():

    def dic_factorization(n):

        dic = {}  # 素数:指数

        i = 2

        while i * i <= n:

            while n % i == 0:

                n //= i

                if i in dic:

                    dic[i] += 1

                else:

                    dic[i] = 1

            i += 1

        if n > 1:

            dic[n] = 1

        return dic



    MOD = 10 ** 9 + 7

    N = int(eval(input()))

    exp = [0] * (N + 1)

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

        dic_prime = dic_factorization(i)

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

            exp[k] += v



    ans = 1

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

        ans *= exp[i] + 1

        ans %= MOD



    print(ans)



if __name__ == "__main__":

    resolve()
import math

n = math.factorial(int(eval(input())))
i = 2
ans = 1
M = 10**9 + 7
while i * i <= n:
    cnt = 1
    while n % i == 0:
        cnt += 1
        n //= i
    ans *= cnt
    i += 1
if n != 1:
    ans *= 2
print((int(ans % M)))

def resolve():
    def dic_factorization(n):
        dic = {}  # 素数:指数
        i = 2
        while i * i <= n:
            while n % i == 0:
                n //= i
                if i in dic:
                    dic[i] += 1
                else:
                    dic[i] = 1
            i += 1
        if n > 1:
            dic[n] = 1
        return dic

    MOD = 10**9 + 7
    N = int(eval(input()))
    exp = [0] * (N + 1)
    for i in range(2, N + 1):
        dic_prime = dic_factorization(i)
        for k, v in list(dic_prime.items()):
            exp[k] += v
    ans = 1
    for i in range(2, N + 1):
        ans *= exp[i] + 1
        ans %= MOD
    print(ans)


if __name__ == "__main__":
    resolve()

-import math +def resolve(): +    def dic_factorization(n): +        dic = {}  # 素数:指数 +        i = 2 +        while i * i <= n: +            while n % i == 0: +                n //= i +                if i in dic: +                    dic[i] += 1 +                else: +                    dic[i] = 1 +            i += 1 +        if n > 1: +            dic[n] = 1 +        return dic -n = math.factorial(int(eval(input()))) -i = 2 -ans = 1 -M = 10**9 + 7 -while i * i <= n: -    cnt = 1 -    while n % i == 0: -        cnt += 1 -        n //= i -    ans *= cnt -    i += 1 -if n != 1: -    ans *= 2 -print((int(ans % M))) +    MOD = 10**9 + 7 +    N = int(eval(input())) +    exp = [0] * (N + 1) +    for i in range(2, N + 1): +        dic_prime = dic_factorization(i) +        for k, v in list(dic_prime.items()): +            exp[k] += v +    ans = 1 +    for i in range(2, N + 1): +        ans *= exp[i] + 1 +        ans %= MOD +    print(ans) + + +if __name__ == "__main__": +    resolve()