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;
char s[15], c[15];
int check(int x) {
  sprintf(c, "%d", x);
  int i, j;
  for (i = 0; c[i]; i++) {
    for (j = 0; s[j]; j++)
      if (c[i] == s[j]) return 1;
  }
  return 0;
}
int main() {
  int i, add = 0;
  scanf("%d", &n);
  sprintf(s, "%d", n);
  add += check(1);
  for (i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      if (n != i * i) {
        add += check(i);
        add += check(n / i);
      } else
        add += check(i);
    }
  }
  if (n > 1)
    printf("%d\n", add + 1);
  else
    printf("%d\n", add);
  return 0;
}
