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 check(long long a, long long b) {
  vector<int> v(10);
  while (a) {
    v[a % 10] = 1;
    a /= 10;
  }
  while (b) {
    if (v[b % 10]) return true;
    b /= 10;
  }
  return false;
}
int main() {
  long long n, i, r = 0;
  cin >> n;
  for (i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (check(i, n)) r++;
      if (check(n / i, n) && i * i != n) r++;
    }
  }
  cout << r;
}
