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;


public class L_elefant {
    
    static boolean hasSame(int a, int b){
        
        String s1=a+"";
        String s2=b+"";
        
        for(int i=0;i<s1.length();i++){
            for(int j=0;j<s2.length();j++){
                if(s1.charAt(i)==s2.charAt(j))
                    return true;
            }
        }
        return false;
    }
    
    public static void main(String[] args) throws NumberFormatException, IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        
        int n=Integer.parseInt(br.readLine());
        
        int c=0;
        for(int i=1;i<=Math.sqrt(n);i++){
            if(n%i==0){
                if(hasSame(n,i))
                    c++;
                
                if(i*i!=n && hasSame(n, n/i))
                    c++;
            }
        }
        System.out.println(c);
    }
}
