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;
const long long MOD = 1000000007;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 5;
vector<int> d;
bool dig[10];
inline bool check(int n) {
  while (n > 0) {
    if (dig[n % 10]) return true;
    n /= 10;
  }
  return false;
}
int main() {
  int n;
  cin >> n;
  int k = n;
  while (k > 0) dig[k % 10] = 1, k /= 10;
  int r = sqrt(n);
  for (int i = 1; i <= r; i++) {
    if (n % i == 0) {
      d.push_back(i);
      if (i != n / i) d.push_back(n / i);
    }
  }
  int res = 0;
  for (auto i : d)
    if (check(i)) res++;
  cout << res << '\n';
  return 0;
}
