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 sys import stdin
from math import sqrt

x = int(stdin.readline())
root = sqrt(x)
sqr_flag = root.is_integer()
root = int(root)
divs =  reduce(list.__add__,[[k,x/k] for k in range(1,root) if not x%k],[]) + ([root] if sqr_flag else ([] if x%root else [root,x/root]))
base = set(str(x))
print len(filter(lambda k: set(str(k)).intersection(base), divs)),
