from collections import Counter


def factorization(number):
    prime_numbers = Counter()
    divisor = 2
    while divisor ** 2 <= number:
        while number % divisor == 0:
            number //= divisor
            prime_numbers[divisor] = prime_numbers.get(divisor, 0) + 1
        divisor += 1
    if number > 1:
        prime_numbers[number] = 1
    return prime_numbers


def factorial_factorization(number):
    factor = factorization(1)
    for i in range(2, number + 1):
        factor += factorization(i)
    return factor


def count_divisors(factor):
    divisors_amount = 1
    for amount in factor.values():
        divisors_amount *= amount + 1
    return divisors_amount


print(count_divisors(factorial_factorization(int(input()))))