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;
char s[100];
bool A[101];
int main() {
  int n, sol = 0;
  scanf("%d", &n);
  sprintf(s, "%d", n);
  int t = strlen(s);
  for (int i = 0; i < t; i++) A[s[i] - '0'] = 1;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      sprintf(s, "%d", i);
      int t = strlen(s);
      for (int j = 0; j < t; j++)
        if (A[s[j] - '0'] == 1) {
          sol++;
          break;
        }
      s[0] = '\0';
      if (n / i != i) {
        sprintf(s, "%d", n / i);
        t = strlen(s);
        for (int j = 0; j < t; j++)
          if (A[s[j] - '0'] == 1) {
            sol++;
            break;
          }
      }
    }
  printf("%d", sol);
  return 0;
}
