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 ok(int x, int y) {
  bool a[10] = {};
  while (x) a[x % 10] = true, x /= 10;
  while (y)
    if (a[y % 10])
      return true;
    else
      y /= 10;
  return false;
}
int main() {
  int n;
  cin >> n;
  int sq = sqrt(n);
  int ans = 0;
  for (int i = 1; i <= sq; i++) {
    if (n % i == 0) {
      int j = n / i;
      ans += ok(n, i);
      if (i != j) ans += ok(n, j);
    }
  }
  cout << ans << "\n";
  return 0;
}
