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.*;
import java.io.*;

public class Main
{
	public static void main(String[] args)
	throws Exception
	{
		BufferedReader reader = new BufferedReader(
			new InputStreamReader(System.in));

		PrintWriter writer = new PrintWriter(System.out);
		//StringTokenizer sz;

		int num = Integer.parseInt(reader.readLine());
		int count=0;

		int temp = num;
		int freq[] = new int[10];

		while (temp > 0)
		{
			++freq[temp % 10];
			temp /= 10;
		}

		for (int i=1;i * i <= num;++i)
		{
			/*
			<-- i   n/i  -->
			
			ex 10
			1  10
			2  5
			
			9
			1 9
			3 3
			
			n/i * i = n
			
			*/
			if (num % i == 0)
			{
				if (num / i > i)
				{
					count += (test(freq,  num / i) ? 1 : 0);
				}

				if (num / i >= i)
				{
					count += (test(freq, i) ? 1 : 0);
				}

			}

		}

		writer.print(count);
		writer.flush();
	}

	public static boolean test(int arr[], int v)
	{
		while (v > 0)
		{

			if (arr[v % 10] == 0)  
				v /= 10 ;
			else
				return true;

		}

		return false;

	}
}
