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 n;
int main() {
  cin >> n;
  int a = n;
  int counter = 0;
  vector<int> v;
  while (a) {
    v.push_back(a % 10);
    a /= 10;
  }
  for (int i = 1; i <= sqrt(n) + 0; i++) {
    if (n % i == 0) {
      int b = i;
      while (b) {
        int c = b % 10;
        bool t = false;
        for (int i = 0; i < v.size(); i++) {
          if (c == v[i]) {
            counter++;
            t = true;
            break;
          }
        }
        if (t) break;
        b /= 10;
      }
      int d = n / i;
      if (d == b) {
        break;
      }
      while (d) {
        int e = d % 10;
        bool l = false;
        for (int i = 0; i < v.size(); i++) {
          if (e == v[i]) {
            counter++;
            l = true;
            break;
          }
        }
        if (l) break;
        d /= 10;
      }
    }
  }
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  cout << counter << endl;
  return 0;
}
