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 n, a[100], ans;
int find(int x) {
  while (x > 0) {
    if (a[x % 10]) return true;
    x /= 10;
  }
  return false;
}
int main() {
  scanf("%d", &n);
  memset(a, 0, sizeof(a));
  int tp = n;
  while (tp > 0) {
    a[tp % 10] = true;
    tp /= 10;
  }
  ans = 0;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      int tp = i;
      if (find(tp)) ans++;
      if (i != n / i && find(n / i)) ans++;
    }
  printf("%d\n", ans);
}
