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