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;
int main() {
  int n;
  cin >> n;
  int temp = n;
  vector<int> v;
  set<int> s;
  while (temp > 0) {
    s.insert(temp % 10);
    temp /= 10;
  }
  int cnt = 0;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      v.push_back(i);
      if (i != n / i) v.push_back(n / i);
    }
  }
  for (int i = 0; i < v.size(); ++i) {
    int p = 0;
    temp = v[i];
    while (temp > 0) {
      int emni = 0;
      emni = s.size();
      p = temp % 10;
      temp /= 10;
      s.insert(p);
      if (emni == s.size()) {
        cnt++;
        break;
      } else
        s.erase(p);
    }
  }
  cout << cnt << endl;
  return 0;
}
