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 x, i, sq, count = 0, tmp, bucket[10];
int chk(int a) {
  while (a != 0) {
    if (bucket[a % 10]) {
      count++;
      return 1;
    }
    a /= 10;
  }
  return 0;
}
int main() {
  scanf("%d", &x);
  tmp = x;
  while (tmp != 0) {
    bucket[tmp % 10] = 1;
    tmp /= 10;
  }
  sq = (int)sqrt(x);
  for (i = 1; i <= sq; i++) {
    if (x % i == 0) {
      chk(i);
      chk(x / i);
    }
  }
  if (x == sq * sq && chk(sq)) {
    count -= 2;
  }
  printf("%d\n", count);
}
