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 same_dig(a, b):
    s1 = str(a)
    s2 = str(b)
    for i in range(10):
        if str(i) in s1 and str(i) in s2:
            return 1
    return 0

d = int(raw_input())
i = 1
ans = 0
while i * i <= d:
    (x, y) = divmod(d, i)
    if y == 0:
       ans += same_dig(d, x)
       if x != i:
           ans += same_dig(d, i) 
    i += 1
print ans