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
ct = 0
a = int(input())
sa1 = [x for x in str(a)]
for i in range(1, int(a**0.5)+1):
    if a%i==0:
        if i == a**0.5:
            sa2 = [x for x in str(i)]
            if set(sa1).intersection(set(sa2)) != set():
                ct += 1
        else:
            sa2 = [x for x in str(i)]
            if set(sa1).intersection(set(sa2)) != set():
                ct += 1
                
            sa2 = [x for x in str(int(a/i))]
            if set(sa1).intersection(set(sa2)) != set():
                ct += 1
print(ct)
