The Little Elephant loves numbers. 

He has a positive integer x. The Little Elephant wants to find the number of positive integers d, such that d is the divisor of x, and x and d have at least one common (the same) digit in their decimal representations. 

Help the Little Elephant to find the described number.

Input

A single line contains a single integer x (1 ≤ x ≤ 109).

Output

In a single line print an integer — the answer to the problem.

Examples

Input

1


Output

1


Input

10


Output

2
def factors(n):    
    return set(reduce(list.__add__, 
                ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))
def checkDigits(a, b):
    same = False
    a = str(a)
    b = str(b)
    for i in range(len(a)):
        if a[i] in b:
            same = True
            break
    return same

num = raw_input()
num = int(num)
count = 0
factors = factors(num)
for i in factors:
    if checkDigits(i, num):
        count += 1

print count
