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 has[10];
int f(int x) {
  while (x > 0) {
    if (has[x % 10]) {
      return 1;
    }
    x /= 10;
  }
  return 0;
}
int main() {
  int n;
  cin >> n;
  int tmp = n;
  while (tmp > 0) {
    has[tmp % 10] = 1;
    tmp /= 10;
  }
  int sol = 0;
  for (int d = 1; d * d <= n; ++d) {
    if (n % d == 0) {
      sol += f(d) + (d * d < n ? f(n / d) : 0);
    }
  }
  cout << sol << '\n';
  return 0;
}
