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 same(long long n, long long m) {
  char cn[100], cm[100];
  sprintf(cn, "%I64d", n);
  sprintf(cm, "%I64d", m);
  for (int i = 0; i < strlen(cn); i++)
    for (int j = 0; j < strlen(cm); j++)
      if (cn[i] == cm[j]) return 1;
  return 0;
}
int main() {
  long long n;
  while (cin >> n) {
    int count = 0;
    long long i;
    for (i = 1; i * i <= n; i++)
      if (n % i == 0) {
        if (same(i, n)) count++;
        if (i != n / i)
          if (same(n / i, n)) count++;
      }
    cout << count << endl;
  }
}
