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 t1[10], t2[10];
void split_number(int k, int res[]) {
  memset(res, 0, 10 * sizeof(res[0]));
  do {
    ++res[k % 10];
  } while (k /= 10);
}
bool check_similarity(int t1[], int t2[]) {
  bool ok = 0;
  for (int i = 0; i < 10; ++i) {
    ok |= t1[i] && t2[i];
  }
  return ok;
}
void solveTheProblem(void) {
  int x;
  cin >> x;
  split_number(x, t1);
  int res = 0;
  for (int i = 1; i * i <= x; ++i) {
    if (x % i == 0) {
      split_number(i, t2);
      res += check_similarity(t1, t2);
      if (i * i != x) {
        split_number(x / i, t2);
        res += check_similarity(t1, t2);
      }
    }
  }
  cout << res << endl;
}
int main(void) {
  solveTheProblem();
  return 0;
}
