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.*;
/**
 *
 * @author Hamzah
 */
public class Littleelephantandnumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int d,n=sc.nextInt(),count=0,j;
        d=n;
        
        boolean mask[]=new boolean[10];
        Arrays.fill(mask, false);
        
        while(d>0){
          mask[d%10]=true;
          d=d/10;
        }
        d=n;
        int k= (int) Math.sqrt(n);
        for(int i=1;i<=k;i++){
            if(n%i==0){
                j=i;
              while(j>0){
                  if(mask[j%10]==true){
                      count++;
                      break;
                  }
                  else{   j=j/10;
              }  
              }
              j=n/i;
              if(j==i)
                  continue;
              while(j>0){
                  if(mask[j%10]){
                      count++;
                      break;
                  }
                  else{
                      j=j/10;
                  }
              }
              
                
            }
            
            
            
        }
        
        
        
       
        
        
        
        
        
         System.out.println(count);

}
}