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.*;
import java.math.*;
/*Author LAVLESH*/
public class solution
{   static boolean yes(int a,int b)
	{
	String s=""+a,c=""+b;
	for(int i=0;i<c.length();i++)
	{
		int p=-1;
		p=s.indexOf(c.substring(i,i+1));
		if(p!=-1) return true;
	}return false;
	}
	public static void main(String[]args){
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		
		int i,j,count=0;
		
		for(i=1;i*i<=n;i++)
		{
			if(n%i==0&&yes(n,n/i)){count++;}
			if(n%i==0&&yes(n,i)) {count++;}
			
		}
		if((Math.pow((int)Math.sqrt(n),2)==n)&&count!=1&&yes(n,(int)Math.sqrt(n)))
		System.out.println(count-1);
		else System.out.print(count);
		
}}

