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;
const long long INFLL = 1e18;
int v[10] = {};
int f(int n) {
  while (n) {
    if (v[n % 10] == 1) {
      return 1;
    }
    n /= 10;
  }
  return 0;
}
int main() {
  int n, d;
  cin >> n;
  d = n;
  int s = 0;
  while (n) {
    v[n % 10] = 1;
    n /= 10;
  }
  for (int i = 1; i * i <= d; i++)
    if (d % i == 0 and (f(i) || f(d / i))) {
      s = s + f(i) + f(d / i) - (i * i == d);
    }
  cout << s << endl;
  return 0;
}
