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 cc[10];
void c(int k) {
  for (int i = 0; i < 10; ++i) {
    cc[i] = false;
  }
  while (k > 9) {
    cc[k % 10] = true;
    k /= 10;
  }
  cc[k] = true;
}
int main() {
  int n;
  cin >> n;
  int k = n;
  bool x[10];
  int sum = 0;
  for (int i = 0; i < 10; ++i) {
    x[i] = false;
  }
  while (k > 9) {
    x[k % 10] = true;
    k /= 10;
  }
  x[k] = true;
  for (int i = 1; i <= (int)sqrt(1. * n); i++) {
    if (!(n % i)) {
      c(i);
      for (int i = 0; i < 10; i++) {
        if (cc[i] && x[i]) {
          sum++;
          break;
        }
      }
      if (1. * i != sqrt(1. * n)) {
        c(n / i);
        for (int i = 0; i < 10; i++) {
          if (cc[i] && x[i]) {
            sum++;
            break;
          }
        }
      }
    }
  }
  cout << sum;
  return 0;
}
