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 a[20];
int main() {
  int b, s, ans = 0;
  long long int n;
  cin >> n;
  b = n;
  while (b) {
    s = b % 10;
    a[s] = 1;
    b /= 10;
  }
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      b = i;
      while (b) {
        s = b % 10;
        if (a[s] == 1) {
          ans++;
          break;
        }
        b /= 10;
      }
      if (i * i != n) {
        b = n / i;
        while (b) {
          s = b % 10;
          if (a[s] == 1) {
            ans++;
            break;
          }
          b /= 10;
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
