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;
int dig(int m, int n) {
  set<int> a;
  while (m) {
    a.insert(m % 10);
    m = m / 10;
  }
  while (n) {
    int x = n % 10;
    if (a.find(x) != a.end()) return 1;
    n = n / 10;
  }
  return 0;
}
int main() {
  int n, ans = 0;
  cin >> n;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      int y = n / i;
      if (dig(i, n)) ans++;
      if (y != i)
        if (dig(y, n)) ans++;
    }
  }
  cout << ans << endl;
  return 0;
}
