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>
void answer(unsigned v) { std::cout << v << '\n'; }
void solve(unsigned x) {
  std::set<unsigned> f;
  for (unsigned i = 1; i * i <= x; ++i) {
    if (x % i == 0) {
      f.insert(i);
      f.insert(x / i);
    }
  }
  std::set<unsigned> d;
  while (x != 0) {
    d.insert(x % 10);
    x /= 10;
  }
  unsigned k = 0;
  for (unsigned q : f) {
    while (q != 0) {
      if (d.count(q % 10) == 1) {
        ++k;
        break;
      }
      q /= 10;
    }
  }
  answer(k);
}
int main() {
  unsigned x;
  std::cin >> x;
  solve(x);
  return 0;
}
