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 fs(int a, int b) {
  int s[20], ss[20];
  int j = 0, k = 0;
  while (a > 0) {
    s[j++] = a % 10;
    a /= 10;
  }
  while (b > 0) {
    ss[k++] = b % 10;
    b /= 10;
  }
  for (int i = 0; i < j; i++) {
    for (int ii = 0; ii < k; ii++) {
      if (s[i] == ss[ii]) return 1;
    }
  }
  return 0;
}
int main() {
  int n, ans = 0, m;
  cin >> n;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      m = n / i;
      if (fs(n, i)) {
        ans++;
      }
      if (m != i && fs(n, m)) {
        ans++;
      }
    }
  }
  cout << ans << endl;
}
