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>
int main() {
  int n, x, i, ct = 0;
  scanf("%d", &n);
  for (i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      int x = n;
      bool vis[10] = {false};
      while (x > 0) {
        vis[x % 10] = 1;
        x /= 10;
      }
      x = i;
      while (x > 0) {
        if (vis[x % 10]) {
          ct++;
          break;
        }
        x /= 10;
      }
      x = n / i;
      if (x != i) {
        while (x > 0) {
          if (vis[x % 10]) {
            ct++;
            break;
          }
          x /= 10;
        }
      }
    }
  }
  printf("%d\n", ct);
  return 0;
}
