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 c136B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int total = 0;
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		boolean[] digits = new boolean[10];
		String s = "" + x;
		for (int i = 0; i < s.length(); i++)
			digits[s.charAt(i) - '0'] = true;
		
		int sq = (int) Math.sqrt(x);
		if (sq*sq < x)
			sq++;
		else {
			s = "" + sq;
			for (int j = 0; j < s.length(); j++)
				if (digits[s.charAt(j) - '0']) {
					total++;
					break;
				}
		}
		
		for (int i = 1; i < sq; i++) {
			if (x%i == 0) {
				s = "" + i;
				for (int j = 0; j < s.length(); j++)
					if (digits[s.charAt(j) - '0']) {
						total++;
						//System.out.print('+');
						break;
					}
				//System.out.print(i + ", ");
				s = "" + (x/i);
				for (int j = 0; j < s.length(); j++)
					if (digits[s.charAt(j) - '0']) {
						total++;
						//System.out.print('+');
						break;
					}
				//System.out.println(x/i);
					
			}
				
		}
		
		System.out.println(total);
	}

}
