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() {
  long long x;
  cin >> x;
  long long m = sqrt(x / 1.0);
  long long ans = 0;
  int A[10];
  for (int i = 0; i < 10; i++) A[i] = 0;
  long long ma = x;
  while (ma) {
    A[ma % 10] = 1;
    ma /= 10;
  }
  for (long long i = 1; i <= m; i++) {
    if (x % i == 0) {
      long long f = x / i;
      long long temp = i;
      while (temp) {
        if (A[temp % 10]) {
          ans++;
          break;
        }
        temp /= 10;
      }
      if (f != i) {
        long long temp = f;
        while (temp) {
          if (A[temp % 10] == 1) {
            ans++;
            break;
          }
          temp /= 10;
        }
      }
    }
  }
  cout << ans << endl;
}
