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 B221 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int X = in.nextInt();
        boolean[] stat = new boolean[10];
        int rest = X;
        while (rest > 0) {
            stat[rest%10] = true;
            rest /= 10;
        }
        int answer = 0;
        for (int d=1; d*d<=X; d++) {
            if (X%d == 0 && commonDigit(d, stat)) {
                answer++;
            }
            int dd = X/d;
            if (X%dd == 0 && d != dd && commonDigit(dd, stat)) {
                answer++;
            }
        }
        System.out.println(answer);
    }

    static boolean commonDigit(int d, boolean[] stat) {
        while (d > 0) {
            if (stat[d%10]) {
                return true;
            }
            d /= 10;
        }
        return false;
    }

}
