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;
vector<bool> t(10, false);
void init(int n) {
  while (n) {
    t[n % 10] = true;
    n /= 10;
  }
}
bool common(int i) {
  while (i) {
    if (t[i % 10]) return true;
    i /= 10;
  }
  return false;
}
int main() {
  int n;
  cin >> n;
  init(n);
  int res = 0;
  int i;
  for (i = 1; i * i < n; ++i)
    if (n % i == 0) {
      if (common(i)) ++res;
      if (common(n / i)) ++res;
    }
  if (i * i == n && common(i)) ++res;
  cout << res << '\n';
}
