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 main() {
  int n;
  cin >> n;
  vector<int> del;
  for (int i = 1; i <= sqrt((double)n); i++) {
    if (n % i == 0) {
      del.push_back(i);
      if (i != n / i) del.push_back(n / i);
    }
  }
  vector<short int> vn;
  short int arr[10];
  for (int i = 0; i < 10; i++) arr[i] = 0;
  for (int i = 1; i <= n; i *= 10) {
    arr[(n % (i * 10)) / i] = 1;
  }
  int count = 0;
  for (int i = 0; i < del.size(); i++) {
    for (int j = 1; j <= del[i]; j *= 10) {
      if (arr[(del[i] % (j * 10)) / j] == 1) {
        count++;
        break;
      }
    }
  }
  cout << count;
  return 0;
}
