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>
int n, v[10], z;
int F(int x) {
  for (; x; x /= 10)
    if (v[x % 10]) return 1;
  return 0;
}
int main() {
  scanf("%d", &n);
  for (int i = n; i; i /= 10) v[i % 10] = 1;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) z += F(i) + (i * i < n && F(n / i));
  printf("%d", z);
  return 0;
}
