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 common(string s1, string s2) {
  for (int i = 0; i < s1.size(); i++) {
    for (int j = 0; j < s2.size(); j++) {
      if (s1[i] == s2[j]) {
        return 1;
      }
    }
  }
  return 0;
}
int main() {
  long long n, x, c = 0;
  stringstream ss1, ss2;
  string s1, s2;
  bool b;
  cin >> x;
  ss1 << x;
  ss1 >> s1;
  if (x == 1) {
    cout << 1;
    return 0;
  }
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      ss2 << i;
      ss2 >> s2;
      b = common(s1, s2);
      ss2.clear();
      if (b) {
        c++;
        b = 0;
      }
      n = x / i;
      if (n == i) continue;
      ss2 << n;
      ss2 >> s2;
      b = common(s1, s2);
      ss2.clear();
      if (b) {
        c++;
        b = 0;
      }
    }
  }
  cout << c;
  return 0;
}
