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 d[10];
bool f(int n);
int main() {
  int n, r = 0, i;
  cin >> n;
  int m = n;
  while (m > 0) {
    d[m % 10] = 1;
    m /= 10;
  }
  for (i = 1; i * i < n; i++) {
    if (n % i != 0) continue;
    if (f(i)) r++;
    if (f(n / i)) r++;
  }
  if (i * i == n && f(i)) r++;
  cout << r;
}
bool f(int n) {
  while (n > 0) {
    if (d[n % 10]) return true;
    n /= 10;
  }
  return false;
}
