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