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;
vector<string> v;
int main() {
  long long a;
  cin >> a;
  string k;
  k = to_string(a);
  for (long long i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      string s = to_string(i);
      v.push_back(s);
      if (i * i != a) {
        long long d = a / i;
        s = to_string(d);
        v.push_back(s);
      }
    }
  }
  int co = 0;
  for (int unsigned i = 0; i < v.size(); i++) {
    bool b = false;
    for (int unsigned i2 = 0; i2 < v[i].length(); i2++) {
      for (int unsigned j = 0; j < k.length(); j++) {
        if (k[j] == v[i][i2]) {
          co++;
          b = true;
          break;
        }
      }
      if (b) break;
    }
  }
  cout << co;
  return 0;
}
