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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class p {
	public static void main(String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String temp=br.readLine();
		int n=Integer.parseInt(temp);
		int x=n;
		int a[]=new int[10];
		for(;n!=0;)
		{
			a[n%10]++;
			n/=10;
		}
		int ans=0;
		for(int i=1;i<=Math.sqrt(x);i++)
		{
			if(x%i==0)
			{
				
				int tt=i,state=0;
				for(;tt!=0;)
				{
					if(a[tt%10]>0)
					{
						state=1;
						break;
					}
					tt/=10;
				}
				if(state==1)
					ans++;
			}
			if(x%(x/i)==0&&(x/i)!=i)
			{
				int tt=x/i,state=0;
				for(;tt!=0;)
				{
					if(a[tt%10]>0)
					{
						state=1;
						break;
					}
					tt/=10;
				}
				if(state==1)
					ans++;
			}
		}
		System.out.println(ans);
	}
}
