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 x;
int dx[10];
int ost(int p) {
  for (; p; p /= 10)
    if (dx[p % 10]) return 1;
  return 0;
}
int main() {
  cin >> x;
  int d = 0;
  for (int i = x; i; i /= 10) dx[i % 10] = 1;
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      d += ost(i) + (i * i < x && ost(x / i));
    }
  }
  cout << d;
}
