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 C_221B {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int son = 0;
		for (int i = 1; i <= Math.sqrt(n); i++) {
			if (n%i == 0) {
				if (i <= n/i && tekshir(i,n)) {
					son++;
				}
				if (i < n/i && tekshir(n/i,n)) {
					son++;
				}
			}
		}
		System.out.println(son);
	}

	private static boolean tekshir(int i,int n) {
		String s = "" + n;
		String s1 = "" + i;
		for (int j = 0; j < s1.length(); j++) {
			if (s.indexOf(s1.substring(j,j+1)) != -1) {
				return true;
			}
		}
		return false;
	}
}
