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 arr[10];
int mf(int a, int b) {
  int r = 0;
  for (int i = 0; i < 9; i++) {
    arr[i] = 0;
  }
  while (a > 0) {
    arr[a % 10] = 1;
    a = a / 10;
  }
  while (b > 0) {
    if (arr[b % 10] == 1) {
      r = 1;
      break;
    }
    b = b / 10;
  }
  return r;
}
int main() {
  int n, j, c;
  cin >> n;
  c = 0;
  int sq = sqrt(n);
  for (int i = 1; i <= sq; i++) {
    if (n % i == 0) {
      j = n / i;
      if (i == j) {
        c += mf(n, i);
      } else {
        c += mf(n, i);
        c += mf(n, j);
      }
    }
  }
  cout << c << "\n";
  return 0;
}
