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;
bool check(int x, int n) {
  int i = 0, j = 0, k, l, ct = 0, a[100], b[100];
  while (x > 0) {
    a[i++] = x % 10;
    x /= 10;
  }
  while (n > 0) {
    b[j++] = n % 10;
    n /= 10;
  }
  for (k = 0; k < i; k++) {
    for (l = 0; l < j; l++) {
      if (a[k] == b[l]) ct++;
    }
  }
  if (ct >= 1)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, n, e, s, ct = 0;
  cin >> n;
  s = sqrt(n);
  for (i = 1; i < s + 1; i++) {
    e = n;
    if (e % i == 0) {
      if (check(i, e)) ct++;
      if (i != e / i) {
        e /= i;
        if (check(e, n)) ct++;
      }
    }
  }
  cout << ct << endl;
}
