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 int MAXD = 11;
int n;
bool a[MAXD], b[MAXD];
inline void intoDec(int x, bool* t) {
  for (int i = x; i > 0; i /= 10) t[i % 10] = true;
}
inline bool check(int x) {
  memset(b, 0, sizeof(b));
  intoDec(x, b);
  for (int i = 0; i <= 9; ++i)
    if (a[i] && b[i]) return true;
  return false;
}
int main() {
  scanf("%d\n", &n);
  intoDec(n, a);
  int res = 0;
  for (int i = 1; i * i <= n; ++i)
    if (n % i == 0) {
      int j = n / i;
      res += check(i) + (i != j && check(j));
    }
  printf("%d\n", res);
  fclose(stdin);
  fclose(stdout);
  return 0;
}
