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<int> d;
void divisors(int n) {
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      d.push_back(i);
      if (n / i != i) d.push_back(n / i);
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  vector<int> v;
  int x = n;
  while (x) {
    int rem = x % 10;
    x -= rem;
    x /= 10;
    v.push_back(rem);
  }
  sort(v.begin(), v.end());
  divisors(n);
  int j = 0;
  int ans = 0;
  vector<int> num;
  while (j < d.size()) {
    int k = d[j];
    while (k) {
      int rem = k % 10;
      k -= rem;
      k /= 10;
      num.push_back(rem);
    }
    for (int i = 0; i < num.size(); i++) {
      if (binary_search(v.begin(), v.end(), num[i])) {
        ans++;
        break;
      }
    }
    num.clear();
    j++;
  }
  printf("%d", ans);
  return 0;
}
