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 digit[10];
int num;
bool test(int x) {
  while (x) {
    if (digit[x % 10]) return true;
    x /= 10;
  }
  return false;
}
int main() {
  cin >> n;
  int t = n;
  while (t) {
    digit[t % 10]++;
    t /= 10;
  }
  int ans = 0;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i) {
        if (test(i)) {
          ans++;
        }
      } else {
        if (test(i)) {
          ans++;
        }
        if (test(n / i)) {
          ans++;
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
