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

ar=[0]*12

def match(num):
    global ar
    while(num>0):
        if(ar[num%10]==1): return True
        num/=10
    return False

n=input()
m=n
global ar
while(m!=0):
    ar[m%10]=1
    m/=10
coun=0
sq=int(math.sqrt(n))
for i in range(1,sq+1):
    if(n%i==0):
        if(match(i)):
            #print i
            coun+=1
        div=n/i
        if(match(div) and i!=div):
            coun+=1
            #print n/i
if(n==1): print 1
else: print coun
