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