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;
class Problem {
 public:
  static vector<bool> digits;
};
vector<bool> Problem::digits(10, false);
inline bool match(long long num) {
  while (num != 0) {
    if (Problem::digits[num % 10]) return true;
    num /= 10;
  }
  return false;
}
int main() {
  int num, _num, d = 1, count = 0;
  cin >> num;
  _num = num;
  while (_num != 0) {
    Problem::digits[_num % 10] = true;
    _num /= 10;
  }
  while (d * d < num) {
    if (num % d == 0) {
      if (match(d)) count++;
      if (match(num / d)) count++;
    }
    d++;
  }
  if (d * d == num && match(d)) count++;
  cout << count << endl;
  return 0;
}
