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 match(int a, int b) {
  string A, B;
  while (a > 0) {
    A.push_back(a % 10 + '0');
    a /= 10;
  }
  while (b > 0) {
    B.push_back(b % 10 + '0');
    b /= 10;
  }
  int sa = A.size(), sb = B.size();
  for (int i = 0; i < sa; i++) {
    for (int j = 0; j < sb; j++) {
      if (A[i] == B[j]) return true;
    }
  }
  return false;
}
int main() {
  int n, ans = 0;
  cin >> n;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (n == i * i) {
        if (match(i, n)) ans++;
      } else {
        if (match(i, n)) ans++;
        if (match(n / i, n)) ans++;
      }
    }
  }
  cout << ans << endl;
}
