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
import java.math.BigInteger;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Solution {

    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        Integer x = scan.nextInt();

        Set<Integer> dividers = new HashSet<Integer>();
        for (Integer divider = 1; divider <= Math.sqrt(x); divider++) {
            if (x % divider == 0) {
                if (commonNumbers(divider, x))
                    dividers.add(divider);
                if (commonNumbers(x / divider, x))
                    dividers.add(x / divider);
            }
        }

        System.out.print(dividers.size());
    }

    private static boolean commonNumbers(Integer a, Integer b) {
        String aNumbers = a.toString();
        String bNumbers = b.toString();

        for (int i = 0; i < aNumbers.length(); i++)
            for (int j = 0; j < bNumbers.length(); j++)
                if (aNumbers.charAt(i) == bNumbers.charAt(j))
                    return true;
        return false;
    }


}
