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 digit(x, n):
    for i in range(10):
        if str(i) in str(n) and str(i) in str(x):
            return True
    return False


def factorize(n):  # o(sqr(n))
    c, ans = 1, 0
    while (c * c < n):
        if n % c == 0:
            if digit(c, n):
                ans += 1
            if digit(n // c, n):
                ans += 1
        c += 1

    if c * c == n:
        if digit(c, n):
            ans += 1
    return ans


print(factorize(int(input())))
