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 dust i have come, dust i will be

import math

n=int(input())
hv=[0]*10

xn=str(n)
for i in range(len(xn)):
    hv[int(xn[i])]=1

cnt=1
x=math.sqrt(n)+1

mp={}
for i in range(1,int(x)):
    if n%i==0:
        yn=str(i)
        for j in range(len(yn)):
            if hv[int(yn[j])]==1:
                mp[yn]=1
                break

        yn=str(n//i)
        for j in range(len(yn)):
            if hv[int(yn[j])]==1:
                mp[yn]=1;


print(len(mp))







