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 mark[10];
int n, Ans = 0;
inline bool ok(int n) {
  while (n) {
    if (mark[n % 10]) return true;
    n /= 10;
  }
  return false;
}
int main() {
  cin.sync_with_stdio(0);
  cin >> n;
  int temp = n;
  while (temp) {
    mark[temp % 10] = true;
    temp /= 10;
  }
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      int div_first = i, div_second = n / i;
      if (ok(div_first)) Ans++;
      if (div_first != div_second && ok(div_second)) Ans++;
    }
  cout << Ans << endl;
  return 0;
}
