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 check(int x);
map<int, int> b;
int main() {
  int x;
  cin >> x;
  for (int i = x; i != 0; i = i / 10) {
    b[i % 10] = 0;
  }
  int total = 0;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i == 0) {
      if (check(i) == true) total++;
      if (check(x / i) == true && x / i != i) total++;
    }
  }
  cout << total;
  return 0;
}
bool check(int x) {
  for (int i = x; i != 0; i = i / 10) {
    if (b.count(i % 10) > 0) {
      return true;
    }
  }
  return false;
}
