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
from math import sqrt


def check(n, d):
    n = str(n)
    d = str(d)
    for c in d:
        if c in n:
            return True
    return False


def get_divisors(n):
    m = int(sqrt(n)) + 1
    divisors = set()
    for d in range(1, m):
        if n % d == 0:
            divisors.add(d)
            divisors.add(n // d)
    return list(divisors)


def main():
    n = int(input())
    divs = get_divisors(n)
    c = 0
    for d in divs:
        if check(n, d):
            c += 1
    print(c)

if __name__ == "__main__":
    main()
