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;
import java.util.TreeSet;


public class Main {
    public static boolean cont(String a,String b)
    {
        int length1 = a.length(), length2 = b.length();
        for ( int i = 0; i < length1; i++ )
        {
            for ( int j = 0; j < length2; j++ )
            {
                if ( a.charAt(i) == b.charAt(j) )
                    return true;
            }
        }
        return false;
    }
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int count = 0, n = input.nextInt();
        TreeSet<Integer> set = new TreeSet<Integer>();
        int lim = (int)Math.sqrt(n);
        for (int i =1; i <= lim; i++)
        {
            if ( n%i == 0)
            {
                if ( set.contains(i))
                {
                    break;
                }
                else
                {
                    set.add(i);
                }
                if ( set.contains(n/i))
                {
                    break;
                }
                else
                {
                    set.add(n/i);
                }
            }  
        }
        int length = set.size();
        for ( int i = 0; i < length; i++ )
            if ( cont(""+n,""+set.pollFirst())) count++;
        System.out.println(count);    
    }
}
