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 dg[10];
void anl() {
  int x = n;
  while (x > 0) {
    dg[x % 10] = 1;
    x /= 10;
  }
}
char sf(int x) {
  while (x > 0) {
    if (dg[x % 10] == 1) return 1;
    x /= 10;
  }
  return 0;
}
int main() {
  int i;
  scanf("%d", &n);
  for (i = 0; i < 10; i++) dg[i] = 0;
  anl();
  if (n == 1) {
    printf("1\n");
    exit(0);
  }
  int c = 0;
  for (i = 1; i * i <= n; i++) {
    if (n % i != 0) continue;
    if (sf(i) == 1) c++;
    if (i * i != n)
      if (sf(n / i) == 1) c++;
  }
  printf("%d\n", c);
  scanf("%*d");
}
