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

public class LittleElephantAndNumbers {
    public static void main(String[] args) throws IOException {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        String str = f.readLine();
        int x = Integer.parseInt(str);
        int count = 0;
        for (int i = 1; i*i <= x; i++)
            if (x % i == 0)
            {
                String fac1 = ""+i;
                boolean contains = false;
                for (int j = 0; j < str.length(); j++)
                    if (fac1.indexOf(str.charAt(j)) >= 0)
                        contains = true;
                if (contains)
                    count++;
                
                String fac2 = ""+(x/i);
                contains = false;
                for (int j = 0; j < str.length(); j++)
                    if (fac2.indexOf(str.charAt(j)) >= 0)
                        contains = true;
                if (!fac1.equals(fac2) && contains)
                    count++;
            }
        System.out.println(count);
    }   
}