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
#include <bits/stdc++.h>
int check(std::string s1, std::string s2) {
  for (char a : s1) {
    for (char b : s2)
      if (a == b) return 1;
  }
  return 0;
}
int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  std::cout.tie(0);
  int n;
  std::cin >> n;
  std::set<int> s;
  for (int i = 1; i <= sqrt(n); ++i) {
    if (n % i == 0) s.insert(i), s.insert(n / i);
  }
  int rs = 0;
  for (int x : s) {
    rs += check(std::to_string(n), std::to_string(x));
  }
  std::cout << rs;
}
