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;
  cin >> n;
  clock_t t1, t2;
  t1 = clock();
  char digits[20] = {0};
  sprintf(digits, "%d\n", n);
  int n_d = 0;
  int dig[10] = {0};
  for (; digits[n_d] != '\n'; n_d++) {
    dig[digits[n_d] -= '0'] = 1;
  }
  int count = 1;
  int n2 = n >> 1;
  int n3 = n / 3;
  int n4 = n >> 2;
  for (int i = 1; i <= n4; ++i) {
    if (n % i == 0) {
      int c = i;
      do {
        int o = c % 10;
        c /= 10;
        if (dig[o]) {
          count++;
          break;
        }
      } while (c);
    }
  }
  if (n3 && n % n3 == 0) {
    int c = n3;
    do {
      int o = c % 10;
      c /= 10;
      if (dig[o]) {
        count++;
        break;
      }
    } while (c);
  }
  if (n2 && n % n2 == 0) {
    int c = n2;
    do {
      int o = c % 10;
      c /= 10;
      if (dig[o]) {
        count++;
        break;
      }
    } while (c);
  }
  t2 = clock();
  cout << endl << count;
  return 0;
}
