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 a[10] = {0};
int f(int x) {
  while (x > 0) {
    if (a[x % 10]) return 1;
    x = x / 10;
  }
  return 0;
}
int main() {
  int n;
  cin >> n;
  int t = n;
  while (t > 0) {
    a[t % 10] = 1;
    t = t / 10;
  }
  int ans = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ans += f(i);
      if (i != n / i) ans += f(n / i);
    }
  }
  cout << ans;
  return 0;
}
