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 int maxN = 11;
bool a[maxN];
bool hamsan(int n) {
  while (n > 0) {
    if (a[n % 10] == true) return 1;
    n /= 10;
  }
  return 0;
}
int main() {
  long long n, ans = 0;
  cin >> n;
  if (n == 1) {
    cout << "1";
    return 0;
  }
  int bank = n;
  while (n > 0) {
    if (a[n % 10] == false) a[n % 10] = true;
    n /= 10;
  }
  for (long long i = 1; i <= sqrt(bank); i++) {
    if (hamsan(i) && bank % i == 0) {
      ans++;
    }
    if (hamsan(bank / i) && bank % (bank / i) == 0 && i * i < bank) ans++;
  }
  cout << ans << endl;
  cin >> n;
  return 0;
}
