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[15];
int main() {
  int x, cnt = 0;
  int tmp;
  bool flag;
  memset(a, false, sizeof(a));
  scanf("%d", &x);
  tmp = x;
  while (tmp) {
    a[tmp % 10] = true;
    tmp /= 10;
  }
  for (int i = 1; i * i <= x; ++i) {
    if (x % i == 0) {
      tmp = i;
      flag = false;
      while (tmp) {
        if (a[tmp % 10]) {
          flag = true;
          break;
        }
        tmp /= 10;
      }
      if (flag) ++cnt;
      if (i == x / i) continue;
      tmp = x / i;
      flag = false;
      while (tmp) {
        if (a[tmp % 10]) {
          flag = true;
          break;
        }
        tmp /= 10;
      }
      if (flag) ++cnt;
    }
  }
  printf("%d\n", cnt);
  return 0;
}
