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 num[10];
int ans = 0;
void commun(int m) {
  while (m > 0) {
    if (num[m % 10]) {
      ans++;
      break;
    } else
      m /= 10;
  }
}
int main() {
  int n;
  cin >> n;
  memset(num, 0, 10);
  int k = n;
  while (k >= 1) {
    num[k % 10] = 1;
    k /= 10;
  }
  if (n == 1) {
    ans = 1;
  } else {
    for (int i = 1; i * i <= n; i++) {
      if (n % i == 0) {
        commun(i);
        if (i * i != n) {
          commun(n / i);
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
