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>
bool e[10] = {0};
int find(int x) {
  while (x) {
    if (e[x % 10] == true) return 1;
    x /= 10;
  }
  return 0;
}
int main() {
  int n;
  scanf("%d", &n);
  int tmp = n;
  while (tmp) {
    e[tmp % 10] = true;
    tmp /= 10;
  }
  int ans = 0;
  for (int k = 1; k * k <= n; k++) {
    if (n % k == 0) {
      if (find(k)) ans++;
      if (k * k != n && find(n / k)) ans++;
    }
  }
  printf("%d\n", ans);
  return 0;
}
