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 compute(int a, int b) {
  int array[10];
  for (int i = 0; i <= 9; i++) array[i] = 0;
  while (a) {
    array[a % 10]++;
    a = a / 10;
  }
  while (b) {
    if (array[b % 10] != 0) return 1;
    b = b / 10;
  }
  return 0;
}
int main() {
  int n, summation = 0;
  cin >> n;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (i != n / i)
        summation = summation + compute(n / i, n) + compute(i, n);
      else
        summation += compute(i, n);
    }
  }
  cout << summation;
  return 0;
}
