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.ArrayList;
import java.util.Scanner;

import javax.swing.text.StyledEditorKit.BoldAction;

public class Little_Elephant_and_Numbers {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n;
		n = sc.nextLong();

		ArrayList<Long> a = new ArrayList<>();
		for (int i = 1; i <= Math.sqrt(n); i++) {
			if (n % i == 0) {
				a.add((long) i);
				if (checka(a, n / i))
					a.add(n / i);
			}
		}
		/*for (Long long1 : a) {
			System.out.print(long1 + " ");
		}*/
		ArrayList<Long> b = new ArrayList<>();
		for (Long item : a) {
			if (check(n, item)) {
				b.add(item);
			}
		}
		/*
		 * for (Long long1 : b) { System.out.print(long1 + " "); }
		 */
		System.out.println(b.size());
	}

	static boolean checka(ArrayList<Long> a, long x) {
		for (Long long1 : a) {
			if (x == long1)
				return false;
		}
		return true;
	}

	static boolean check(long n, Long item) {
		String x = String.valueOf(n);
		String y = String.valueOf(item);

		for (int i = 0; i < y.length(); i++) {
			if (x.indexOf(y.charAt(i)) != -1) {
				return true;
			}
		}
		return false;
	}
}
