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 x, res, t;
bool ex[10], check(int);
set<int> s;
int main() {
  cin >> x;
  t = x;
  while (t) {
    ex[t % 10] = true;
    t /= 10;
  }
  int res = 0;
  for (int i = 1, lim = sqrt(x); i <= lim; i++) {
    if (x % i == 0) {
      if (check(i)) s.insert(i);
      if (check(x / i)) s.insert(x / i);
    }
  }
  printf("%d", s.size());
}
bool check(int c) {
  bool res = false;
  while (c) {
    res |= ex[c % 10];
    c /= 10;
  }
  return res;
}
