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
x = int(input())
hash = []
for i in range(10):
    hash.append(0)
t = x
while t > 0:
    hash[t % 10] = 1
    t //= 10
ans = 0
i = 1
while i * i <= x:
    if x % i == 0:
        t = i
        while t > 0 and hash[t % 10] == 0:
            t //= 10
        if t > 0:
            ans += 1
        if x // i != i:
            t = x // i
            while t > 0 and hash[t % 10] == 0:
                t //= 10
            if t > 0:
                ans += 1
    i += 1
print(ans)