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], B[10];
bool func(int a) {
  int c, i;
  for (; a > 0;) {
    if (A[a % 10] > 0) return true;
    a /= 10;
  }
  return false;
}
int main() {
  int i, d = 0, x, b, c;
  cin >> x;
  c = x;
  for (; c > 0;) {
    A[c % 10]++;
    c /= 10;
  }
  for (i = 1; i <= sqrt(x); ++i) {
    if (x % i == 0) {
      b = x / i;
      if (func(b)) {
        d++;
      }
      if (func(i) && i != b) {
        ++d;
      }
    }
  }
  cout << d << endl;
}
