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 ar[10];
void build(int n) {
  while (n > 0) {
    int r = n % 10;
    ar[r] = 1;
    n = n / 10;
  }
}
bool check(int s) {
  while (s > 0) {
    int r = s % 10;
    if (ar[r] == 1) return true;
    s = s / 10;
  }
  return false;
}
int main() {
  int n;
  cin >> n;
  int t = n;
  build(t);
  int ct = 0;
  int st = sqrt(n);
  for (int i = 2; i <= st; i++) {
    if (n % i == 0) {
      int s = i;
      if (check(s)) ct++;
      if (check(n / s)) ct++;
    }
  }
  if (st * st == n && check(st)) ct--;
  if (ar[1] == 1) ct++;
  cout << ct + 1 << "\n";
  return 0;
}
