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, n_num[10], counter = 0;
int check_numbers(int a) {
  while (a != 0) {
    if (n_num[a % 10] != 0) return 1;
    a /= 10;
  }
  return 0;
}
int main() {
  cin >> N;
  int temp = N;
  while (temp != 0) {
    n_num[temp % 10]++;
    temp /= 10;
  }
  for (int i = 1; i <= sqrt(double(N)); i++) {
    if (N % i == 0) {
      counter += check_numbers(i);
      if (i != N / i) counter += check_numbers(N / i);
    }
  }
  cout << counter << endl;
}
