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;
  vector<int> v;
  v.push_back(1);
  if (n >> 1) {
    v.push_back(n);
  }
  for (long long d = 2; d * d <= n; d++) {
    if (n % d == 0) {
      if (n / d == d) {
        v.push_back(d);
      } else {
        v.push_back(d);
        v.push_back(n / d);
      }
    }
  }
  string s = to_string(n);
  map<char, bool> m;
  for (auto c : s) {
    m[c] = true;
  }
  int res = 0;
  for (auto a : v) {
    string t = to_string(a);
    for (auto c : t) {
      if (m[c]) {
        res++;
        break;
      }
    }
  }
  cout << res << endl;
  return 0;
}
