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 common_digit(int a, int b) {
  int flag[10] = {0};
  while (a != 0) {
    flag[a % 10] = 1;
    a /= 10;
  }
  while (b != 0) {
    if (flag[b % 10]) return true;
    b /= 10;
  }
  return false;
}
int main() {
  int x;
  cin >> x;
  int xx = floor(sqrt(x));
  int ans = 0;
  for (; xx > 0; --xx) {
    if (x % xx) continue;
    if (common_digit(x, xx)) {
      ans += 1;
    }
    if (xx != x / xx && common_digit(x, x / xx)) {
      ans += 1;
    }
  }
  cout << ans << endl;
  return 0;
}
