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;
void file() {}
int cnt = 0;
string s;
void check(int n) {
  string divistring = to_string(n);
  for (auto k = 0; k < s.length(); k++) {
    for (auto j = 0; j < divistring.length(); j++) {
      if (s[k] == divistring[j]) {
        cnt++;
        return;
      }
    }
  }
}
int main() {
  file();
  int x;
  cin >> x;
  s = to_string(x);
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      if (x / i == i) {
        check(i);
      } else {
        check(i);
        check(x / i);
      }
    }
  }
  cout << cnt << "\n";
  return 0;
}
