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;
  int a[20];
  int i, j;
  while (scanf("%d", &n) != EOF) {
    memset(a, 0, sizeof(a));
    int s = 0;
    int m = n;
    while (m) {
      a[m % 10]++;
      m = m / 10;
    }
    for (int i = 1; i * i <= n; i++) {
      if (n % i == 0) {
        j = i;
        while (j) {
          if (a[j % 10] != 0) {
            s++;
            break;
          } else
            j = j / 10;
        }
        j = n / i;
        if (i * i != n) {
          while (j) {
            if (a[j % 10] != 0) {
              s++;
              break;
            } else
              j = j / 10;
          }
        }
      }
    }
    if (n == 1)
      printf("1\n");
    else
      printf("%d\n", s);
  }
}
