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 B {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();

        int cnt = 0;
        for (int i = 1; i * i <= x; i++)
            if (x % i == 0) {
                if (check(x, i))
                    cnt++;
                if (i != x / i && check(x, x / i))
                    cnt++;
            }
        System.out.println(cnt);
    }

    private static boolean check(int a, int b) {
        boolean[] v = new boolean[10];
        while (a != 0) {
            v[a % 10] = true;
            a /= 10;
        }
        while (b != 0) {
            if (v[b % 10])
                return true;
            b /= 10;
        }
        return false;
    }

}