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
n = int(input())
strN = str(n)
digits = [0 for x in range(10)]
for i in range(len(strN)):
  digits[int(strN[i])] = 1
resp = {}
sqrtN = int((n ** 0.5) + 1)
for i in range(1, sqrtN):
  if n % i == 0:
    strI = str(i)
    for j in range(len(strI)):
      if digits[int(strI[j])] == 1:
        resp[strI] = 1
        break
    strNDivI = str(n//i)
    for j in range(len(strNDivI)):
      if digits[int(strNDivI[j])] == 1:
        resp[strNDivI] = 1
        break
print (len(resp))
  				   			 	  	 		 	 		   	