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 check(int a, int b) {
  int d = a;
  int e = b;
  int c = 0;
  while (e >= 1) {
    d = a;
    while (d >= 1) {
      if (d % 10 == e % 10) {
        c++;
        return 1;
      }
      d /= 10;
    }
    e /= 10;
  }
  return 0;
}
int main() {
  int a, n = 0, flag = 0;
  ;
  cin >> a;
  for (int c = 1; c < (int)sqrt(a); c++) {
    if (a % c == 0) {
      if (check(a, c)) {
        n++;
      }
      if (check(a, a / c)) {
        n++;
      }
    }
  }
  if (a % (int)sqrt(a) == 0) {
    if (check(a, (int)sqrt(a))) {
      n++;
    }
    if (a / (int)sqrt(a) != (int)sqrt(a) && a % (int)sqrt(a) == 0) {
      if (check(a, a / (int)sqrt(a))) {
        n++;
      }
    }
  }
  cout << n;
}
