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 s=new Scanner(System.in);
		int n=s.nextInt();
		int[] arr =new int[11];
		int p=1;
		int t=n;
		while(t>=1){
			arr[p]=t%10;
			t=t/10;
			p++;
		}p--;
		int ans=0;
		for(int i=1;i<=Math.sqrt(n);i++){
			if(n%i==0){
				int flag=0;
				int che;
				int tt=i;
				while(tt>=1){
					if(flag==0){
						che=tt%10;
						for(int l=1;l<=p;l++){
							if(che==arr[l]){
								//System.out.println("Case1  "+tt);
								ans++;
								flag=1;
								break;
							}
						}
					
					}tt=tt/10;
				}
				
				tt=n/i;
				if(tt!=i){
					flag=0;
				//	System.out.println("num is:"+tt);
					while(tt>=1){
						if(flag==0){
							che=tt%10;
							for(int l=1;l<=p;l++){
								if(che==arr[l]){
								//	System.out.println("Case2 "+tt);
									ans++;
									flag=1;
									break;
								}
							}
						
						}tt=tt/10;
					}
				}
			}
		}System.out.println(ans);
	}
}