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 fun1(vector<int> &v, set<char> &s) {
  int kol = 1;
  string help;
  set<char>::iterator p;
  for (int i = 0; i < v.size(); i++) {
    help = "";
    stringstream ss;
    ss << v[i];
    ss >> help;
    for (int j = 0; j < help.size(); j++) {
      p = s.find(help[j]);
      if (p != s.end()) {
        kol++;
        break;
      }
    }
  }
  return kol;
}
int main() {
  string s;
  int n;
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  vector<int> v;
  for (int i = 2; i <= 20; i++) {
    if (n % i == 0) {
      v.push_back(n / i);
    }
  }
  for (int i = 1; i <= n / 21; i++) {
    if (n % i == 0) {
      v.push_back(i);
    }
  }
  set<char> S1;
  stringstream ss;
  ss << n;
  string s1;
  ss >> s1;
  for (int i = 0; i < s1.length(); i++) {
    S1.insert(s1[i]);
  }
  int kol = fun1(v, S1);
  cout << kol << endl;
  cin >> kol;
  return 0;
}
