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 hasC(int a, int b) {
  set<int> as;
  while (a) {
    as.insert(a % 10);
    a /= 10;
  }
  while (b) {
    if (as.count(b % 10) > 0) return true;
    b /= 10;
  }
  return false;
}
int main(int argc, const char* argv[]) {
  int n;
  cin >> n;
  int t = n;
  int ans = 0;
  if (n == 1)
    ans = 1;
  else
    for (int i = 1; i * i <= t; i++) {
      if (t % i == 0) {
        if (hasC(t, i)) ans++;
        if (i * i != n && hasC(t, t / i)) ans++;
      }
    }
  cout << ans;
  return 0;
}
