# 約数の列挙
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

N = int(input())

ans = set()
for div in make_divisors(N):
    partner = N//div
    candi = str(div) + str(partner)
    ans.add(candi)

print(len(ans))