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>
using namespace std;
bool g(int a, int b) {
  vector<int> x, y;
  while (a) {
    x.push_back(a % 10);
    a /= 10;
  }
  while (b) {
    y.push_back(b % 10);
    b /= 10;
  }
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  for (auto z : y)
    if (binary_search(x.begin(), x.end(), z)) return true;
  return false;
}
int main() {
  int n;
  cin >> n;
  set<int> s;
  for (int i = 1; i <= sqrt(n) + 1; i++) {
    if (n % i == 0) {
      s.insert(i);
      s.insert(n / i);
    }
  }
  int c = 0;
  for (auto v : s) c += g(v, n);
  cout << c << '\n';
  return 0;
}
