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
//package Practice;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;

public class CF221B {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        ArrayList<Integer> ans = findDiv(n);
        HashSet<Integer> set = new HashSet<>();
        int k = n;
        while(k != 0){
            set.add(k % 10);
            k /= 10;
        }
        int count = 0;
        for (int i = 0; i < ans.size(); i++) {
            boolean bool = checkDigits(ans.get(i), set);
            if(bool){
                count++;
            }
        }

        System.out.println(count);
    }

    private static boolean checkDigits(int num, HashSet<Integer> set) {
        while(num != 0){
            if(set.contains(num % 10)){
                return true;
            }
            num /= 10;
        }
        return false;
    }

    private static ArrayList<Integer> findDiv(int num){
        ArrayList<Integer> ans = new ArrayList<>();
        for (int i = 1; i <= Math.sqrt(num); i++) {
            if(num % i == 0){
                ans.add(i);
                if(num/i != i){
                    ans.add(num/i);
                }
            }
        }
        return ans;
    }
}
