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 ok(n,q):
    countn,countq=[0]*10,[0]*10
    while n>0:
        countn[n%10]=1
        n//=10
    while q>0:
        countq[q%10]=1
        q//=10
    for i in range(10):
        if countn[i]==countq[i] and countn[i]>0:
            return True
    return False
n=int(input())
ans=0
sq=int((n)**0.5)
for i in range(1,sq+1):
    if n%i==0 and n//i!=i:
        if ok(i,n):
            ans+=1
        if ok(n//i,n):
            ans+=1
    if n%i==0 and n//i==i:
        if ok(i,n):
            ans+=1
print(ans)