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;
  scanf("%d", &n);
  int ans = 0;
  bool v[10];
  for (int i = 0; i < 10; i++) v[i] = false;
  for (int i = n; i; i /= 10) v[i % 10] = true;
  vector<int> ff;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ff.push_back(i);
      if (i * i != n) ff.push_back(n / i);
    }
  }
  for (int i = 0; i < (int)ff.size(); i++) {
    int k = ff[i];
    bool f = false;
    for (int j = k; j; j /= 10)
      if (v[j % 10]) {
        f = true;
        break;
      }
    if (f) ans++;
  }
  printf("%d\n", ans);
  return 0;
}
