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 n1[10];
void grt(int n) {
  int i, k;
  while (n > 0) {
    k = n % 10;
    n /= 10;
    n1[k] = true;
  }
}
bool check(int n) {
  int i, k;
  while (n > 0) {
    k = n % 10;
    n /= 10;
    if (n1[k]) return true;
  }
  return false;
}
int main() {
  int n, p, ans = 1;
  cin >> n;
  int i = 1;
  grt(n);
  i = 1;
  ans = 0;
  while (i * i <= n) {
    if (!(n % i)) {
      if (check(i)) ans++;
      p = n / i;
      if ((p != i) && (check(p))) ans++;
    }
    i++;
  }
  cout << ans;
  return 0;
}
