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