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 x;
bool hasCommonDigit(int n) {
  int copyX = x;
  vector<int> cX(10, 0);
  vector<int> cN(10, 0);
  while (copyX > 0) {
    cX[copyX % 10]++;
    copyX /= 10;
  }
  while (n > 0) {
    cN[n % 10]++;
    n /= 10;
  }
  for (int i = 0; i < 10; i++) {
    if (cX[i] > 0 && cN[i] > 0) return true;
  }
  return false;
}
set<int> divisors;
int main() {
  cin >> x;
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      if (hasCommonDigit(i)) {
        divisors.insert(i);
      }
      if (hasCommonDigit(x / i)) {
        divisors.insert(x / i);
      }
    }
  }
  cout << divisors.size() << endl;
  return 0;
}
