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, int);
int main() {
  int x;
  cin >> x;
  int ans = 0;
  int top = sqrt(x);
  for (int j = 1; j <= top; ++j) {
    if (x % j == 0) {
      if (check(x, j) == true) {
        ++ans;
      }
      if (x / j != j && check(x, x / j) == true) {
        ++ans;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
bool check(int x, int n) {
  while (n > 0) {
    int digN = n % 10;
    int t = x;
    while (t > 0) {
      if (t % 10 == digN) return true;
      t /= 10;
    }
    n /= 10;
  }
  return false;
}
