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 main() {
  int n, ans = 0;
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  int k = n;
  map<int, int> ma;
  while (k) ma[k % 10] = 1, k /= 10;
  for (int i = 1, limit = sqrt(n); i <= limit; ++i) {
    if (n % i == 0) {
      int a = i, b = n / i;
      bool flag = false;
      while (a) {
        if (ma[a % 10]) {
          ++ans;
          flag = true;
          break;
        }
        a /= 10;
      }
      while (b) {
        if (ma[b % 10]) {
          ++ans;
          flag = true;
          break;
        }
        b /= 10;
      }
      if (i == n / i && flag) --ans;
    }
  }
  cout << ans << endl;
  return 0;
}
