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 K[10];
int x;
bool find(int g) {
  while (g) {
    if (K[g % 10]) return 1;
    g /= 10;
  }
  return 0;
}
int main() {
  cin >> x;
  if (x == 1) {
    cout << 1;
    return 0;
  }
  int v = x;
  while (v) {
    K[v % 10] = 1;
    v /= 10;
  }
  int s = 0, i = 1;
  for (; i * i < x; ++i) {
    if (x % i == 0) {
      s += find(i);
      s += find(x / i);
    }
  }
  if (i * i == x && find(i)) ++s;
  cout << s << endl;
}
