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 dug(int n, int m) {
  int d, x, i;
  while (n > 0) {
    d = n % 10;
    i = m;
    while (i > 0) {
      x = i % 10;
      if (d == x) return 1;
      i /= 10;
    }
    n /= 10;
  }
  return 0;
}
int main() {
  int c = 0, n, i, x, d, sq;
  cin >> x;
  sq = sqrt(x);
  for (i = 1; i <= sq; i++) {
    if (x % i == 0 && i * i != x) {
      d = x / i;
      if (dug(d, x)) {
        c++;
      }
      if (dug(i, x)) {
        c++;
      }
    } else if (x % i == 0) {
      if (dug(i, x)) c++;
    }
  }
  cout << c;
}
