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
import sys

n = int(input())
arr = [0,0,0,0,0,0,0,0,0,0]
number = str(n)
counter = 0
x = math.sqrt(n)+1
divisores = []

for i in range(len(number)):
    arr[int(number[i])]=1
    
for i in range(1,int(x)):
    if n%i==0:
        d = str(i)
        for j in range(len(d)):
            if arr[int(d[j])]==1:
                divisores.append(d)
                break
        inv_d = str(n//i)
        for j in range(len(inv_d)):
            if arr[int(inv_d[j])]==1:
                divisores.append(inv_d)
div = list(dict.fromkeys(divisores))
print(len(div))

				   	    	   	  		  	 	  	