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 math import sqrt

def factorization(n):
    fact=[]
    for i in range(1, int(sqrt(n)+1)):
        if n%i == 0:
            fact.append(i)
            fact.append(n//i)
    return fact
s=0
n = int(input())
n2=str(n)
fact=factorization(n)
Setfact=set(fact)
fact=list(Setfact)
for i in range(len(Setfact)):
    for j in range(len(n2)):
        if n2[j] in str(fact[i]):
            s+=1
            break
print(s)


