n = int(input())

def make_divisors(n):
    divisors = []
    propose = []
    square = 0
    
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            cur = []
            if i != n // i:
                cur.append(i)
                cur.append(n//i)
            else:
                cur.append(n//i)
                cur.append(n//i)
                square += 1
                
            propose.append(str(cur[0]) + str(cur[1]))
            propose.append(str(cur[1]) + str(cur[0]))
            
    return len(list(set(propose)))

res = make_divisors(n)

print(res)