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

public class B {

	static boolean test(int i, int j) {
		String s = i + "";
		String s2 = j + "";
		for (int k = 0; k < s.length(); k++)
			if (s2.contains(s.charAt(k) + ""))
				return true;
		return false;
	}

	public static void main(String[] args) {
		int ans = 0;
		Scanner scan = new Scanner(System.in);
		int x = scan.nextInt();
		int n = (int) Math.sqrt(x) + 1;

		for (int i = 1; i < n; i++) {
			if (x % i == 0) {
				boolean b = test(i, x);
				if (b)
					ans++;

				//				System.out.println(i + " " + x / i);
				if (i != x / i) {
					b = test(x / i, x);
					if (b)
						ans++;
				}
			}
		}
		System.out.println(ans);

	}
}
