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
def getDigits(N):
  ret = set()
  while N:
    ret.add(N%10)
    N /= 10
  return ret
    
def check(N, M):
  return len(getDigits(N) & getDigits(M))

def getElephantNumbers(N):
  i = 1
  ret = 0
  while True:
    if N%i == 0:
      if check(N, i): ret += 1
      if check(N, N/i) and i != N/i: ret += 1
    i += 1
    if i * i > N: break
  return ret

print getElephantNumbers(int(raw_input()))
