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 static java.lang.Math.sqrt;
import java.util.ArrayList;



/**
 *
 * @author LENOVO
 */
public class Main{
    static ArrayList<String> arr = new ArrayList();
    static void factor(int n)
    {
        for (int i=1;i<=sqrt(n);i++)
        if(n%i==0)
        {
            arr.add(i+"");
            if(i!=sqrt(n))
                arr.add(n/i+"");
        }
    }
     public static void main (String []args)throws IOException
            
    {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    int t=Integer.parseInt(in.readLine());
    factor(t);
    String A , B ;int counter = 0;
    A=t+"";
    for (int i=0;i<A.length();i++)
    {
        
        for (int j=0;j<arr.size();j++)
        {
            
            for (int z=0;z<arr.get(j).length();z++)
                if(arr.get(j).charAt(z)==A.charAt(i))
                {
                    counter++;
                    arr.set(j, "");
                    z=arr.get(j).length()+1;
                }
        }
    }
        System.out.println(counter);//sdfsd
    }
}