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;

/**
 * 
 */

/**
 * @author Korayyem @ date Aug 31, 2012 @ time 6:21:21 PM
 * 
 */
public class CF136D2B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		if (n == 1) {
			System.out.println(1);
		} else {
			int counter = 1;
			for (int i = 1; i <= Math.sqrt(n); i++) {
				if (n % i == 0) {
					if (ok(i,n)) {
						counter++;
					}
					if (i!=1&&n / i != i && ok(n / i, n)) {
						counter++;
					}
				}
			}
			System.out.println(counter);
		}

	}

	/**
	 * @param i
	 * @param n
	 * @return
	 */
	private static boolean ok(int i, int n) {
		String s = i + "";
		String ss = n + "";
		for (int j = 0; j < s.length(); j++) {
			if (ss.contains(s.charAt(j) + "")) {
				return true;
			}
		}
		return false;
	}

}
