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