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 main() {
  int x, d = 0, c[10] = {};
  cin >> x;
  int y = x;
  while (y > 0) {
    c[y % 10] = 1;
    y /= 10;
  }
  vector<int> a;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i == 0) {
      a.push_back(i);
      a.push_back(x / i);
    }
  }
  if (a[a.size() - 1] == a[a.size() - 2]) a.erase(a.begin() + a.size() - 1);
  for (int i = 0; i < a.size(); i++) {
    while (a[i] > 0) {
      if (c[a[i] % 10] == 1) {
        d++;
        a[i] = 0;
      } else
        a[i] /= 10;
    }
  }
  cout << d;
  return 0;
}
