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 Teste {
	
	public static void main(String args[]) {
		
		//Input values
		Scanner input = new Scanner(System.in);
		int x = input.nextInt();
		input.close();
		
		//Logica
		int resp = 0;
		for (int i = 1; i * i <= x; i++) {
            if (x % i == 0 && x / i != i) {
                if (contem(x, i)) {
                    resp++;
                }
                if (contem(x, x / i)) {
                    resp++;
                }
            } else if (x % i == 0 && x / i == i) {
                if (contem(x, i)) {
                    resp++;
                }
            }
        }
		System.out.println(resp);
	}
	
	public static boolean contem(int x, int v) {
		String comp1 = "" + x;
		String comp2 = "" + v;
		for (int i = 0; i < comp2.length(); i++) {
            if (comp1.contains("" + comp2.charAt(i))) {
                return true;
            }
        }
		return false;
	}
}
 	  						  	 	 	 	 	 	 	 	 		