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.Scanner;
public class littleElephant {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int x = sc.nextInt();
        
        boolean[] digitos = new boolean[10];
         int n = x;
         int resposta = 0;
         while(n>0) {
             int indice = n%10;
             digitos[indice] = true;
             n=n/10;
         }
         
         for(int i = 1; i <= Math.sqrt(x); i++) {
             if(x%i==0) {
                 if(temDigito(i, digitos)) {
                     resposta++;
                 }
                 if(temDigito(x/i,digitos)) {
                     resposta++;
                 }
             }
         }
         
         if(x == (int)Math.sqrt(x) *(int)Math.sqrt(x) ) {
             if(temDigito((int)Math.sqrt(x), digitos)) {
                 resposta--;
             }
         }
         
         System.out.println(Integer.toString(resposta));
    }
    
    public static boolean temDigito(int i, boolean[] digitos) {
        int n = i;
        while(n>0) {
            int indice = n%10;
            if(digitos[indice] == true) {
                return true;
            }
            n=n/10;
        }
        return false;
    }
}

						 					   	  	 	 	 	 		 	