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;
long a;
int b[10];
bool check(long i) {
  while (i) {
    if (b[i % 10]) return true;
    i /= 10;
  }
  return false;
}
int main(int argc, char *argv[]) {
  scanf("%ld", &a);
  long h = a;
  long ans = 0;
  for (int i = 0; i < 10; i++) b[i] = 0;
  while (h) {
    b[h % 10]++;
    h /= 10;
  }
  for (int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      if (check(i)) ans++;
      if (i != a / i && i != 1)
        if (check(a / i)) ans++;
    }
  }
  if (a != 1) ans++;
  printf("%d\n", ans);
  return EXIT_SUCCESS;
}
