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 Elephant {
        
	public static void main(String[]args){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		String num=""+n;
		int count=0;
		for(int i=1;i*i<=n;i++){
			if(n%i==0){
				if(check(num,i)){
					count++;
				}
			if(i*i!=n&&check(num,n/i))
				count++;
		}}
		
		
		
		System.out.println(count);
		
		
		
	}

	private static boolean check(String num, long i) {
	
		String num2=""+i;
		for(int k=0;k<num2.length();k++){
			if(num.contains(""+num2.charAt(k)))
				return true;
		}
	
	
	return false;
	}
	
	
	
}
