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 sys import stdin,stdout
nmbr = lambda: int(stdin.readline())
lst = lambda: list(map(int,stdin.readline().split()))
def fn(x,fact):
    same=0
    for ch in str(x):
        for ch1 in str(fact):
            if ch==ch1:return 1
    return 0
for _ in range(1):#nmbr()):
    n=nmbr()
    p=1;ans=0
    while p*p<=n:
        if n%p==0:
            ans+=fn(n,p)
            if p!=n//p:ans+=fn(n,n//p)
        p+=1
    print(ans)