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.io.*;
import java.util.*;

public class MainClass {
	
	public static void main(String[] args) {
		Locale.setDefault(Locale.US);
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		MainClass solution = new MainClass();
		solution.run(in, out);
		in.close();
		out.close();
	}
	
	public void run(Scanner in, PrintWriter out) {
		int x = in.nextInt();
		int ans = 0;
		for (int i = 1; i * i <= x; i++) {
			if (x % i == 0) {
				if (check(i, x))
					ans++;
				if (i * i != x && check(x / i, x))
					ans++;
			}
		}
		out.print(ans);
	}
	
	public boolean check(int x, int y) {
		boolean[] used = new boolean[10];
		while (x > 0) {
			used[x % 10] = true;
			x /= 10;
		}
		while (y > 0) {
			if (used[y % 10])
				return true;
			y /= 10;
		}
		return false;
	}
	
}