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


def degrees(num_list):
    res = 1
    for number, degree in num_list:
        res *= 2 * degree + 1
    res = (res - 1) // 2
    return res


n = int(input())
factor = factorization(n)
print(degrees(factor))