n = int(input())

def divisors(n):
    div = []
    i = 1
    while(i * i <= n):
        if n % i == 0:
            div.append([i, n // i])
        i += 1
    return div


div = divisors(n)

count = 0
for d in div:
    if str(d[0]) + str(d[1]) == str(d[1]) + str(d[0]):
        count += 1
    else:
        count += 2

print(count)