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 a, int b) {
  vector<int> h1(10, 0), h2(10, 0);
  while (a) {
    ++h1[a % 10];
    a /= 10;
  }
  while (b) {
    ++h2[b % 10];
    b /= 10;
  }
  for (int(i) = (int)(0); (i) < (int)(10); ++(i))
    if (h1[i] != 0 && h2[i] != 0) return true;
  return false;
}
int main() {
  int x;
  cin >> x;
  int ans = 0;
  for (int d = 1; d * d <= x; ++d)
    if (x % d == 0) {
      int a = x / d;
      ans += check(x, d);
      if (d != a) ans += check(x, a);
    }
  cout << ans << endl;
  return 0;
}
