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
(function main() {
    var n = parseInt(readline());
    var s = 0;
    var i = 0;
    var re = new RegExp('[' + n + ']');
    for ( ; i * i < n ; ++i) 
    if (n % i == 0) {
        if (re.test(i)) ++s;
        if (re.test(n / i)) ++s;
    }
    if (i * i == n && re.test(i)) ++s;
    print(s);
})();