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.*;

public class Main {

	public static void main(String[] args) {
		Scanner kb = new Scanner(System.in);
		int x = kb.nextInt();
		if(x==1){
			System.out.println("1");
			return;			
		}
		int array[] = new int[30000];
		int num = 0;
		String a = ""+x;
		int count = 0;
		for(int i=2;i<=Math.sqrt(x);i++){
			if(x%i==0){
				array[count++] = i;
				int temp = x/i;
				if(temp!=i)array[count++] = temp;
			}
		}
		array[count++] = 1;
		array[count++] = x;
		for(int i=0;i<count;i++){
			String b = ""+array[i];
			boolean check = false;
			for(int j=0;j<b.length();j++){
				if(a.contains(""+b.charAt(j))){
					check = true;
					break;
				}
			}
			if(check==false){
				for(int j=0;j<a.length();j++){
					if(b.contains(""+a.charAt(j))){
						check = true;
						break;
					}
				}
			}
			if(x%array[i]==0&&check==true){
				//System.out.println(array[i]);
				num++;
			}
		}
		System.out.println(num);
		
	}


}
