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.util.Scanner;

public class CommonDigitDivisor {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        String num = scan.nextLine();
        int n = Integer.parseInt(num);

        int count = 0;
        double root = Math.sqrt(n);
        for (int i = 1; i <= root; i++) {
            if(n%i == 0){
                String s = Integer.toString(i);
                for (int j = 0; j < s.length(); j++) {
                    if(num.indexOf(s.charAt(j)) >= 0){
                        count++;
                        break;
                    }
                }
                if(i == n/i) break;

                s = Integer.toString(n/i);
                for (int j = 0; j < s.length(); j++) {
                    if(num.indexOf(s.charAt(j)) >= 0){
                        count++;
                        break;
                    }
                }
            }
        }

        System.out.println(count);
    }
}
