import math

def factorize(n):
    factors = {}
    i = 2
    while i * i <= n:
        while n % i == 0:
            factors[i] = factors.get(i, 0) + 1
            n = n // i
        i += 1
    if n > 1:
        factors[n] = 1
    return factors

def generate_divisors(factors):
    divisors = [1]
    for prime, exp in factors.items():
        current_powers = [prime**e for e in range(exp + 1)]
        new_divisors = []
        for d in divisors:
            for pow_val in current_powers:
                new_divisors.append(d * pow_val)
        divisors = new_divisors
    divisors = sorted(divisors)
    return divisors

n = int(input())
if n == 0:
    print(0)
else:
    factors = factorize(n)
    divisors = generate_divisors(factors)
    sqrt_n = math.isqrt(n)
    ans = 0
    for a in divisors:
        if a > sqrt_n:
            break
        b = n // a
        if a * b != n:
            continue
        if a == b:
            ans += 1
        else:
            ans += 2
    print(ans)