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 go(int x, int i) {
  string a, b;
  stringstream ss;
  ss << x;
  ss >> a;
  ss.clear();
  ss << i;
  ss >> b;
  for (int i = 0; i < a.size(); i++) {
    if (b.find(a[i]) != -1) return 1;
  }
  return 0;
}
int main() {
  long long x;
  int ans = 0;
  cin >> x;
  for (long long i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      if (go(i, x)) ans++;
      if (go(x / i, x) && i != x / i) ans++;
    }
  }
  cout << ans << endl;
}
