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 r(): return raw_input().strip()
def ri(): return int(r())
def riv(): return map(int, r().split())

def main():
    x = ri()

    xs = set(list(str(x)))
    count = 0
    i = 1
    while i <= sqrt(x):
        if x % i == 0 and (xs & set(list(str(i)))):
            count += 1

        if x % i == 0  and i != (x/i) and (xs & set(list(str(x/i)))):
            count += 1

        i += 1
        
    print count
        
    
if __name__ == "__main__":
    main()
