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 Same(int d, int x);
int main() {
  int n;
  int res = 0;
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (i * i != n) {
        res += Same(i, n);
        res += Same(n / i, n);
      } else
        res += Same(i, n);
    }
  }
  cout << res << endl;
  return 0;
}
int Same(int d, int x) {
  set<int> s;
  while (d != 0) {
    s.insert(d % 10);
    d /= 10;
  }
  while (x != 0) {
    if (s.find(x % 10) != s.end()) return 1;
    x /= 10;
  }
  return 0;
}
