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.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Vaibhav Mittal
 */
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) {
        long x = in.nextInt();
        int res = 0;
        for (long d = 1; d * d <= x; ++d) {
            if (x % d != 0) continue;
            if (sameDigit(d, x)) ++res;
            if (d * d == x) continue;
            if (sameDigit(x / d, x)) ++res;
        }
        out.println(res);
	}
    
    public boolean sameDigit(long d, long x) {
        String D = String.valueOf(d);
        String X = String.valueOf(x);
        for (int i = 0; i < D.length(); ++i)
            for (int j = 0; j < X.length(); ++j)
                if (D.charAt(i) == X.charAt(j))
                    return true;
        return false;
    }
}

