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 Prob221B {
	public static void main(String[] Args) {
		Scanner scan = new Scanner(System.in);
		int x = scan.nextInt();
		boolean[] dig = new boolean[10];

		int temp = x;
		for (; temp > 0; temp /= 10)
			dig[temp % 10] = true;

		int ans = 0;
		for (int i = 1; i < Math.sqrt(x); i++)
			if (x % i == 0) {
				temp = i;
				for (; temp > 0; temp /= 10)
					if (dig[temp % 10]) {
						ans++;
						break;
					}

				temp = x / i;
				for (; temp > 0; temp /= 10)
					if (dig[temp % 10]) {
						ans++;
						break;
					}
			}

		if ((int)Math.sqrt(x) * (int)Math.sqrt(x) == x) {
			temp = (int) Math.sqrt(x);
			for (; temp > 0; temp /= 10)
				if (dig[temp % 10]) {
					ans++;
					break;
				}
		}

		System.out.println(ans);
	}
}
