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
n = int(input())
i = 1
p = str(n)
d = 0
while i ** 2 <= n:
    if n % i == 0:
        s_possible = False
        t_possible = False
        s = str(i)
        t = str(n // i)
        for j in range(len(p)):
            for k in range(len(s)):
                if p[j] == s[k]:
                    s_possible = True
        for j in range(len(p)):
            for k in range(len(t)):
                if p[j] == t[k]:
                    t_possible = True
        if s != t:
            if s_possible:
                d += 1
            if t_possible:
                d += 1
        else:
            if s_possible:
                d += 1
    i += 1
print(d)
