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 KSubsetsRecursiveLoop {

    public static void main(String[] args) throws IOException {

        BufferedReader k=new BufferedReader(new InputStreamReader(System.in));
        long num=Long.parseLong(k.readLine());
        if (num==1) {
            System.out.println(1);
            return;
        }
        int count=0;
        for (long i = 1; i*i <= num; i++) {
            if (num%i==0) {
                String n=num+"";
                String j=i+"";
                for (int j2 = 0; j2 < j.length(); j2++) {
                    if (n.contains(j.charAt(j2)+"")) {
                        count++;
                        break;
                    }
                }
                if (i==num/i) {
                    continue;
                }
                j=""+num/i;
                for (int j2 = 0; j2 < j.length(); j2++) {
                    if (n.contains(j.charAt(j2)+"")) {
                        count++;
                        break;
                    }
                }
                
                
            }
        }
        double check=Math.sqrt(num);

        System.out.println(count);
        
    }

}