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.IOException;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Vector;

public class B {
    static Vector<Integer> primes;

    public static void main(String[] args) throws IOException {
        Scanner myScanner = new Scanner(System.in);
        int n = myScanner.nextInt(), nn = n;
        int[] dig = new int[10];
        while (nn > 0) {
            dig[nn % 10] = 1;
            nn /= 10;
        }
        int cnt = 0;
        for (long i = 1; i * i <= n; i++) {
            if (n % i == 0) {
                nn = (int) i;
                while (nn > 0) {
                    if (dig[nn % 10] == 1) {
                        cnt++;
                        break;
                    }
                    nn /= 10;
                }
                nn = (int) (n / i);
                if (nn != i)
                    while (nn > 0) {
                        if (dig[nn % 10] == 1) {
                            cnt++;
                            break;
                        }
                        nn /= 10;
                    }
            }
        }
        System.out.println(cnt);

    }
}
 