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;
int n;
int a[15];
int k = 0;
bool chk(int i2) {
  while (i2) {
    int temp = i2 % 10;
    for (int i = 0; i < k; i++)
      if (a[i] == temp % 10) return true;
    i2 /= 10;
  }
  return false;
}
int main() {
  int c = 0;
  cin >> n;
  int temp = n;
  while (temp) {
    a[k++] = temp % 10;
    temp /= 10;
  }
  for (int i = 1; i <= sqrt(n); i++) {
    if (i * i != n) {
      if (n % i == 0) {
        if (chk(i)) {
          c++;
        }
        if (chk(n / i)) {
          c++;
        }
      }
    } else {
      if (chk(i)) c++;
    }
  }
  cout << c << endl;
  return 0;
}
