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.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.TreeSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author George Marcus
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
	public void solve(int testNumber, Scanner in, PrintWriter out) {
        int x = in.nextInt();
        int aux = x;
        TreeSet<Integer> digits = new TreeSet<Integer>();
        while(aux > 0) {
            digits.add(aux % 10);
            aux /= 10;
        }

        int ans = 0;
        for(int d = 1; d * d <= x; d++)
            if(x % d == 0) {
                ans += check(digits, d);
                if(d * d < x)
                    ans += check(digits, x / d);
            }

        out.print(ans);
	}

    private int check(TreeSet<Integer> digits, int d) {
        while(d > 0) {
            if(digits.contains(d % 10))
                return 1;
            d /= 10;
        }
        return 0;
    }
}

