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.HashSet;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
	
	public static boolean validacion(int c, int n) {
		String cad = c + "";
		String r = n + "";

		for (int i = 0; i < cad.length(); i++) {
			for (int j = 0; j < r.length(); j++) {
				if (cad.charAt(i) == r.charAt(j))
					return true;
			}
		}
		return false;
	}

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int valor = n;
		int div = 2;
		int res = 0;
		
		HashSet<Integer> tabla = new HashSet<Integer>();
		LinkedList<Integer> lista = new LinkedList<Integer>();
		lista.add(1);
		if (valor != 1)lista.add(valor);

		while (div <= (valor / div)) {
			if (n % div == 0) {
				if (!tabla.contains(div)) {
					lista.add(div);

					tabla.add(div);
				}
				if (!tabla.contains(valor / div)) {
					lista.add(valor / div);

					tabla.add(valor / div);
				}
			}
			div++;

		}
		for (int i = 0; i < lista.size(); i++) {
			if (validacion(lista.get(i), valor))
				res++;
		}
		System.out.println(res);
	}
}
