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 n, i, k, m;
bool used[12];
int main() {
  while (~scanf("%d", &n)) {
    k = n;
    memset(used, false, sizeof(used));
    while (k) {
      used[k % 10] = true;
      k /= 10;
    }
    m = 0;
    for (i = 1; i * i <= n; i++)
      if (n % i == 0) {
        k = i;
        while (k) {
          if (used[k % 10]) {
            m++;
            break;
          }
          k /= 10;
        }
        if (i * i == n) continue;
        k = n / i;
        while (k) {
          if (used[k % 10]) {
            m++;
            break;
          }
          k /= 10;
        }
      }
    printf("%d\n", m);
  }
  return 0;
}
