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;
bool check(int a, int b) {
  bool arr[10] = {false};
  while (a > 0) {
    arr[a % 10] = true;
    a /= 10;
  }
  while (b > 0) {
    if (arr[b % 10] == true) {
      return true;
    }
    b /= 10;
  }
  return false;
}
int main() {
  int sol = 0;
  int n, i;
  cin >> n;
  for (i = 1; i * i < n; i++) {
    if (n % i == 0) {
      if (check(n, i)) sol++;
      if (check(n, n / i)) sol++;
    }
  }
  if (i * i == n) {
    if (check(n, i)) sol++;
  }
  cout << sol << endl;
}
