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
import math
def divisors(n):
    ans=[]
    for i in range(1,int(math.sqrt(n))+1):
        if n%i==0:
            ans.append(i)
            if n/i!=i:
                ans.append(int(n/i))
    return ans

n=int(input())
count=0
ans=divisors(n)
for i in range(0,len(ans)):
    p=str(ans[i])
    for i in range(0,len(p)):
        if p[i] in str(n):
            count+=1
            break
print(count)
