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;
bool A[10], B[10];
bool f(int a, int b) {
  memset(A, 0, sizeof(A)), memset(B, 0, sizeof(B));
  while (a) A[a % 10] = true, a /= 10;
  while (b) B[b % 10] = true, b /= 10;
  for (int i = 0; i < 10; ++i)
    if (A[i] and B[i]) return true;
  return false;
}
int main() {
  int n = ({
    int __t;
    scanf("%d", &__t);
    __t;
  }),
      r = 0;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      r += f(n, i) + f(n, n / i);
    }
    if (i * i == n) r -= f(n, i);
  }
  printf("%d\n", r);
}
