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 A[20], B[20], D, N;
bool cifre(int X) {
  B[0] = 0;
  while (X) B[++B[0]] = X % 10, X /= 10;
  for (int i = 1; i <= A[0]; i++)
    for (int j = 1; j <= B[0]; j++)
      if (A[i] == B[j]) return 1;
  return 0;
}
int main() {
  int i;
  int ans = 0;
  scanf("%i", &N);
  int cpy = N;
  A[0] = 0;
  while (cpy) A[++A[0]] = cpy % 10, cpy /= 10;
  for (i = 1; i * i < N; i++) {
    if (N % i == 0) {
      if (cifre(i)) ans++;
      if (cifre(N / i)) ans++;
    }
  }
  if (i * i == N && cifre(i)) ans++;
  printf("%i\n", ans);
  return 0;
}
