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;
long long v[10];
int solve(long long x) {
  while (x) {
    if (v[x % 10])
      return 1;
    else
      x /= 10;
  }
  return 0;
}
int main() {
  long long n, ans;
  cin >> n;
  ans = n;
  while (ans) v[ans % 10] = 1, ans /= 10;
  ans = 0;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) ans += solve(i) + ((i * i < n) ? solve(n / i) : 0);
  }
  cout << ans << endl;
  return 0;
}
