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;

public class B136 {

    public void solve() {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int i = 0, j = 0;
        int dev = 0, count = 0;
        String s1 = "", s2 = "[" + n + "]";



        for (i = 1; i <= Math.sqrt(n); i = i + 1) {
            dev = n % i;
            if (dev == 0) {
                s1 = i + "";
                if (s1.replaceAll(s2, "").length() < s1.length()) {
                    count++;
                }
                s1 = n / i + "";
                if (n / i != Math.sqrt(n) && s1.replaceAll(s2, "").length() < s1.length()) {
                    count++;
                }
            }

        }




        System.out.println(count);

    }

    public static void main(String[] args) {
        new B136().solve();


    }
}
